Marriage Hall Time Slot Booking
Marriage Hall Time Slot Booking
MediumBinary Search100% accepted
Ravi is planning his wedding reception in Bangalore and needs to find the first available time slot. The marriage hall has blocked times for other events, and available slots are in a sorted array.
Approach
Given an array of occupied time slots and a target slot time, find the first available slot >= target time.
Input
occupied=[1800, 1900, 2000, 2100, 2200], target=1850
Output
2300
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