Temple Queue Wait Time Minimization
Temple Queue Wait Time Minimization
HardArrays0% accepted
Meera manages the darshan queue at Bangalore's Veerabhadra Temple with N devotees having different service times. By optimally reordering the queue, find the minimum possible maximum waiting time for any devotee.
Approach
Given an array of N service times, find the minimum possible maximum wait time after queue reordering.
Input
n=4, times=[5,3,4,2]
Output
9
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