Linked List Problems

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

This track covers reversing, merging, reordering and splitting lists, cycle detection, fast and slow pointers, doubly linked lists and cache design. 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 Turn the Chain Around, Chain Reads Both Ways and Reverse a Two-Way Chain.
• Core Problems: 16 medium problems such as Chain Addition, Pop the Middle and Flatten the Folder Chain.
• Hard Problems: 7 hard problems such as Reverse in Batches, Cursor Text Editor and Referral Order Copy.

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.