Recognition signal
When should you think of Greedy?
A locally optimal choice can be proven never to reduce the quality of the remaining solution.
13 worked problems
Greedy
Take the locally best choice and never look back. A locally optimal choice can be proven never to reduce the quality of the remaining solution.
Core invariant
What must stay true?
Processed choices form an optimal prefix that never needs to be reconsidered.
Practice in a deliberate order
Core
Recognize variations
What to learn in this cluster
- 01Simple one-pass choices
- 02Sort then choose
- 03Scheduling and exchange arguments
All Greedy problems
13 of 13 walkthroughsNo matching problems. Try another title, tag, or difficulty.
- #455 Assign Cookiesgreedy · sorting · two pointersEasy
- #860 Lemonade Changegreedy · arrayEasy
- GFG Shortest Job Firstgreedy · sorting · schedulingEasy
- #45 Jump Game IIgreedy · array · bfsMedium
- #55 Jump Gamegreedy · arrayMedium
- #134 Gas Stationarray · greedy · simulationMedium
- #678 Valid Parenthesis Stringgreedy · strings · stackMedium
- #763 Partition Labelsstring · greedy · hash-tableMedium
- GFG N Meetings in One Roomgreedy · sorting · intervalsMedium
- GFG Minimum Number of Platformsgreedy · sorting · two-pointersMedium
- GFG Fractional Knapsackgreedy · sortingMedium
- #135 Candygreedy · arrayHard
- GFG Job Sequencing Problemgreedy · sorting · schedulingHard
Continue the cluster