Recursion and Backtracking Problems

Practise 35 recursion and backtracking problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers subsets, permutations, combinations, partitions, board puzzles, pruning and recursive thinking. 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: 12 easy problems such as Memo Fibonacci, Every Leaf Route and Nobody Gets Their Own.
• Core Problems: 16 medium problems such as Fast Power, Word on the Board and Plus-Plus Flip Game.
• Hard Problems: 7 hard problems such as Reverse in Batches, Visit Every Square and Sliding Tiles.

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.