Greedy
Make the best-looking choice at each step — fast and simple, when you can prove it's safe.
This topic is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.
What is in it
- 1When greedy works (and when it doesn't)Try to break your greedy rule with a small counterexample; if you can't, prove it with an exchange argument. Pro
- 2Earliest finish firstTo fit the most non-overlapping activities, always take the one that ends soonest. Pro
- 3Farthest reach (Jump Game)Track the farthest index you can reach; to count jumps, treat each jump's range as one BFS level. Pro
- 4Running balances (Gas Station)When a running total goes negative, no start inside that stretch can work — restart after it. Pro