AlgoSolveoRoadmap › Stage 9: Greedy & Dynamic Programming › Pattern 42 of 53
DSA pattern guide
Greedy — Sorting
Order items so a local rule gives the global best.
Use it when
Order items so a local rule gives the global best.
Key idea
Find the comparison that makes the best local choice, sort by it, sweep once.
Practice problems, in order
- Maximum Units on a TruckEasy
- Assign CookiesEasy
- Lemonade ChangeEasy
- Largest NumberMedium
- Partition LabelsMedium
- Next PermutationMedium
- Gas StationMedium
- Candy DistributionHard
How to practise this pattern
- Read the problem and look for the signal above before writing any code.
- Say the brute force out loud, with its time complexity, then ask what work it repeats.
- Apply the key idea and write the optimised version yourself.
- If you're stuck for more than 10 minutes, take one small hint, not the full solution.
- Move to the next problem only when you can explain why this pattern fits.
Stuck on one of these?
The AlgoSolveo extension (free, launching soon) sits beside the LeetCode problem and gives the smallest hint that gets you moving, never the full answer. Solved problems tick off on your roadmap.
Join the extension waitlistTrack it on the roadmap