Binary Search Problems

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

This track covers searching sorted and rotated data, finding boundaries, searching on the answer, and searching in two dimensions. 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 Sorted Pair Finder, First Broken Build and Guess the Ticket.
• Core Problems: 16 medium problems such as Two Squares Make It, Kth in the Sorted Grid and Rank Board.
• Hard Problems: 7 hard problems such as Lowest With Repeats, Longest Repeated Piece and Below K in Ranges.

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.