Longest Waiting Customer Segment
Longest Waiting Customer Segment
HardArrays0% accepted
A Jio store in Mumbai tracks customer wait times. Arjun analyzes data to find the longest consecutive period when wait time exceeded 30 minutes to improve service scheduling.
Approach
Given an array of customer wait times in minutes, find the length of longest subarray where each element is ≥ 30.
Input
wait_times=[25,35,40,45,20,50,55,60]
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