Two Pointers Problems

Practise 30 two pointers problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers converging pointers on sorted data, fast and slow pointers, in-place partitioning, merging and pair or triple searches. 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: 10 easy problems such as Push Zeros to the Back, One Delete Away and Pair Sum in Search Tree.
• Core Problems: 14 medium problems such as Label Partitions, Common Free Slot and Smallest Rotation.
• Hard Problems: 6 hard problems such as Bounded Window Count, Best Good Window and Round Cake Slices.

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.