TOPIC
GREEDY
Every greedy problem in the series, in the order the worlds teach them.
17 STAGES
EASY1:35Can Place Flowers
LC 605▶ START
MEDIUM1:35Jump Game
LC 55▶ START
MEDIUM1:37Jump Game II
LC 45▶ START
MEDIUM1:44Gas Station
LC 134▶ START
MEDIUM1:38Minimum Domino Rotations For Equal Row
LC 1007▶ START
HARD1:33Course Schedule III
LC 630▶ START
HARD1:41Candy
LC 135▶ START
MEDIUM1:38Non-overlapping Intervals
LC 435▶ START
MEDIUM1:37Minimum Number of Arrows to Burst Balloons
LC 452▶ START
MEDIUM1:32Partition Labels
LC 763▶ START
MEDIUM1:43Boats to Save People
LC 881▶ START
MEDIUM1:41Remove K Digits
LC 402▶ START
MEDIUM1:36Two City Scheduling
LC 1029▶ START
MEDIUM1:45Maximum Subarray
LC 53▶ START
MEDIUM1:44Hand of Straights
LC 846▶ START
MEDIUM1:44Task Scheduler
LC 621▶ START
MEDIUM1:36Merge Triplets to Form Target Triplet
LC 1899▶ START
More topics
- Dynamic programming 19
- Backtracking 17
- Tree recursion 13
- Bit manipulation 8
- Design 8
- Two pointers 8
- Hash map 7
- Heap 7
- Binary search 6
- Breadth-first search 5
- Linked list 5
- Fast and slow pointers 4
- Grid search 4
- Shortest path 4
- Depth-first search 3
- Math 3
- Carry 2
- Hash set 2
- Matrix 2
- Monotonic stack 2
- Prefix sums 2
- Sliding window 2
- Stack 2
- Topological sort 2
- Trie 2