🪙
Greedy
Locally-optimal choices that win globally.
1
Interval scheduling
0/12you are hereMeetings, platforms, arrows, clip cover.
○Activity Selection○Minimum Arrows○Max Attendable Meetings○Minimum Number of Arrows to Burst Balloons○Non-overlapping Intervals○Maximum Number of Events○Video Stitching○Minimum Number of Taps to Water a Garden○Fewest Railway Platforms○Burst Balloons Arrows○Min Clips Cover Range○Smallest Range Covering Elements
2
Exchange & sort
0/14Sort-then-greedy and monotonic-stack picks.
○Monotone Increasing Digits○Maximum Swap○Two City Scheduling○Largest Triangle Perimeter○Max Chunks To Sort○Assign Mice To Holes○Smallest Subsequence of Distinct Characters○Queue Reconstruction By Height○Two City Travel Cost○Maximize Sum After Negations○Largest Concatenated Number○Remove K Digits Smallest○Queue Reconstruct By Height○Remove Duplicate Letters
3
Allocation
0/15Coins, units, boats, ropes, fuel, jumps.
4
Counting & parity
0/12Flips, increments, chunks, balanced splits.
○Minimum Add to Make Parentheses Valid○Maximize Sum After K Negations○Minimum Deletions for Unique Frequencies○Minimum Operations to Non-Decreasing○Split Balanced RL Strings○Min Flips Alternating Bits○Min Parentheses Additions○Wiggle Subsequence○Minimum Insertions to Balance Parentheses○Score After Flipping Matrix○Min Increments Strictly Increasing○Min Deletions Distinct Frequencies
5
More Greedy
0/16 of 26Everything else that yields to a greedy.
○Eliminate Maximum Number of Monsters○Best Time to Buy and Sell Stock○Car Pooling○Reduce Array Size To Half○Lemonade Change○Best Time to Buy and Sell Stock II○Maximum Length Of Pair Chain○Most Profit Assigning Work○Best Trades Profit○Move Chips Min Cost○Hand Of Straights○Minimum Swaps to Group All 1's○Lemonade Stand Change○Partition Labels○Bag of Tokens○Broken Calculator+10 in the arena
🏁Finish line