Binary Search on interval list
Last updated: May 22, 2026
Quick Overview
Given a list of intervals, implement a binary search algorithm to efficiently determine if a specific target value falls within any of the intervals. The input will be a sorted list of intervals represented as pairs of integers, and the target value as an integer. The output should be a boolean indicating whether the target is contained within any of the intervals.
Supabase
May 22, 202674
12
985 solved
Given a list of intervals, implement a binary search algorithm to efficiently determine if a specific target value falls within any of the intervals. The input will be a sorted list of intervals represented as pairs of integers, and the target value as an integer. The output should be a boolean indicating whether the target is contained within any of the intervals.
Supabase uses this problem in the Technical Screen to evaluate your algorithmic thinking. They expect you to discuss multiple approaches, analyze trade-offs between them, and implement the optimal solution with clean, readable code.
What the Interviewer Expects
- Recognize the underlying problem pattern (sliding window, two pointers, BFS/DFS, etc.)
- Discuss multiple approaches and trade-offs before coding
- Implement an optimal solution with clean, production-quality code
- Handle all edge cases including boundary conditions and invalid input
- Optimize both time and space complexity with clear justification
- Test your solution systematically with well-chosen examples
Key Topics to Cover
How to Approach This
- Clarify input constraints and edge cases before writing code.
- Walk through your approach verbally and confirm with the interviewer before coding.
- Start with a brute force solution, then optimize. Mention time and space complexity.
- Test your solution with examples, including edge cases like empty input or duplicates.
- Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
- What is the worst-case input for your solution?
- How would you test this solution thoroughly?
- How would your solution change if the input was sorted?
Sharpen Your Skills on Codemia
Practice similar problems with our interactive workspace, get AI feedback, and track your progress.
Practice DSA ProblemsSample Answer
Problem Analysis
The problem requires us to determine if a target value falls within any of the given sorted intervals. Each interval is represented by a pair of integers (start, end), and the intervals do not overlap...
Approach
- Binary Search Setup: We will implement a binary search on the list of intervals. The search will focus on the starting points of the intervals.
- Searching for the Target: For each midpoi...
Submit Your Answer
