DSA track

Interval Problems

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

This track covers merging, inserting and covering intervals, scheduling, line sweeps and counting overlaps. 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: 6 easy problems such as Clash-Free Calendar, Free Gaps in the Day and Earliest Clash.
  • Core Problems: 10 medium problems such as Busiest Moment, Darts for Balloons and Busiest Start Time.
  • Hard Problems: 4 hard problems such as Stream to Ranges, City Outline and Flowers in Bloom.

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
  • 20 problems

What it covers

  • Easy6 problems
  • Medium10 problems
  • Hard4 problems

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