Marriage Hall Booking Slot Maximization
Marriage Hall Booking Slot Maximization
HardArrays100% accepted
Ravi operates a premium marriage hall in Delhi receiving N booking requests with start and end dates. Find the maximum number of non-overlapping bookings he can accept to optimize venue utilization.
Approach
Given N intervals of booking slots, find the maximum number of non-overlapping intervals.
Input
n=4, intervals=[[1,3],[2,6],[8,10],[11,12]]
Output
3
More Arrays 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