Graph Problems

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

This track covers breadth-first and depth-first search on grids and graphs, components, topological order, shortest paths, union-find and spanning trees. 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: 7 easy problems such as Paint Bucket, Village Judge and Level Totals of a Nest.
• Core Problems: 29 medium problems such as Fewest Swaps to Order, Hop to Zero and Currency Loop.
• Hard Problems: 9 hard problems such as Visit Every Square, Shared Rail Lines and K Shortest Routes.

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.