DSA track

Design Problems

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

This track covers stateful classes such as caches, counters, calendars, iterators, ledgers and data structures built from scratch. 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: 9 easy problems such as Quick Range Totals, Kth Loudest Live and Streak Watcher.
  • Core Problems: 11 medium problems such as Diary Bookings, Number Lockers and Live Rank Counter.
  • Hard Problems: 5 hard problems such as Kth Ancestor Lookup, Tracked Ranges and Path Maximum With Updates.

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.

  • 3 sections
  • 25 problems

What it covers

  • Easy9 problems
  • Medium11 problems
  • Hard5 problems

Sign in and every problem you have already solved on Revquix is ticked off here.