gitGood.dev

Greedy Interview Questions

Greedy is the shortest correct solution when it works and confidently wrong when it does not, so the interview skill is justifying it. Sorting first, then making one pass taking the best available option, solves a surprising number of scheduling and reachability problems. If you cannot argue why the local choice never forecloses a better global one, assume DP instead.

Recognise it when you see

Interval scheduling, jump/reachability questions, or an optimisation with an obvious local choice.

11 problems. Each one runs in an in-browser editor against real test cases, with hints and a worked solution.

Easy3

Best Time to Buy and Sell StockPremium

EasyDynamic Programming

Assign CookiesPremium

EasyTwo PointersSorting

Can Place FlowersPremium

EasyArrays & Hashing

Medium8

Container With Most WaterPremium

MediumTwo Pointers

Jump GamePremium

MediumDynamic Programming

Gas StationPremium

Medium

Minimum Cost to Connect SticksPremium

MediumHeap / Priority Queue

Network Delay TimePremium

MediumGraphsHeap / Priority Queue

Wiggle SubsequencePremium

MediumDynamic Programming

Jump Game IIPremium

MediumDynamic Programming

Non-overlapping IntervalsPremium

MediumIntervalsSorting

Learn the triggers, not just the templates

The patterns cheat sheet covers all of these in one page - what each one looks like in a problem statement, and the template that follows.

Interview patterns cheat sheet Big-O cheat sheet All coding problems

Greedy Interview Questions

Greedy is the shortest correct solution when it works and confidently wrong when it does not, so the interview skill is justifying it. Sorting first, then making one pass taking the best available option, solves a surprising number of scheduling and reachability problems. If you cannot argue why the local choice never forecloses a better global one, assume DP instead.