Greedy problems

Making the locally best choice at each step and trusting it works out.

1. Maximum Subarray (Medium)
2. Jump Game (Medium)
3. Jump Game II (Medium)
4. Gas Station (Medium)
5. Hand of Straights (Medium)
6. Merge Triplets to Form Target Triplet (Medium)
7. Partition Labels (Medium)
8. Valid Parenthesis String (Medium)