Find Next Interview Time Slot
Find Next Interview Time Slot
MediumBinary Search0% accepted
Meera schedules interviews at Bangalore startup. Booked hours (0-23) are given sorted. She needs earliest available hour. Binary search quickly finds first gap in schedule to block candidate time. Return the smallest hour (0-23) that is not booked.
Approach
Given sorted array of booked hour slots (0-23), find first available hour.
Input
5
9 10 12 13 15
Output
0
More Binary Search problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards