Wagah Border Optimal Checkpoint Planning
Wagah Border Optimal Checkpoint Planning
HardArrays0% accepted
Meera optimizes passenger flow at the Wagah border checkpost. Given individual clearance times, find the minimum number of checkpoints needed to process all passengers within the peak-hour window.
Approach
Given N passenger clearance times and a time window T, find minimum checkpoints required.
Input
clearanceTimes=[2,3,2,4,3,2], timeWindow=10
Output
2
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