- Activity selection / N meetings in one room / maximum trainsEasy✓ Solved1 approach
- Job sequencing with deadlines (maximise profit)Medium✓ Solved1 approach
- Huffman codingMedium✓ Solved1 approach
- Fractional knapsackEasy✓ Solved1 approach
- Minimum number of coins / minimum cost of ropes / connect n ropesEasy✓ Solved1 approach
- Minimum number of platformsMedium✓ Solved1 approach
- Array-value greedy tricks — k negations, arr[i]*i, abs-diff sum, three-stack equal sumMedium✓ Solved2 approaches
- Smallest number with N digits and digit sum SEasy✓ Solved1 approach
- Minimum cost to cut a board / chocolate into piecesMedium✓ Solved1 approach
- Water connection problemMedium✓ Solved1 approach
- Other classic greedy — buy max stocks, candy cost, survive on island, wine trading, amplifiers, K centers, defense of a kingdomMedium✓ Solved1 approach
- Jump GameMedium✓ Solved1 approach
- Partition LabelsMedium✓ Solved1 approach
- Hand of StraightsMedium✓ Solved1 approach
- CandyHard✓ Solved1 approach
- Non-overlapping IntervalsMedium✓ Solved1 approach
- Minimum Number of Arrows to Burst BalloonsMedium✓ Solved1 approach