Sorting Problems

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

This track covers comparators, custom orderings, counting, radix and bucket sort, merge sort, quickselect and sorting-based greedy solutions. 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 Sorted Squares, Clash-Free Calendar and Grades in Linear Time.
• Core Problems: 14 medium problems such as House Alphabet, Next Interval Over and Busiest Start Time.
• Hard Problems: 6 hard problems such as Range Sums in Bounds, Startup Capital and Suffix Order.

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.