Greedy Problems

Practise 25 greedy problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers local choices that are provably optimal, exchange arguments, scheduling and covering problems. The problems run from easy to hard, so each idea builds on the one before. Every problem is judged against hidden test cases in five languages.

What you will practise:

• Basics: 9 easy problems such as Best Buy-Sell Day, Pair Up for Max and Colour Removal Duel.
• Core Problems: 11 medium problems such as Widest Water Tank, Bricks and Ladders and Smallest From Pattern.
• Hard Problems: 5 hard problems such as Startup Capital, Dream Team Output and Marble Bag Spread.

Start with the basics, move on to the core problems, and try the hard ones when the pattern feels natural. Every problem comes with worked examples and clear constraints. For a full path across all of DSA, see Revquix 80, Revquix 150 and Revquix 300.