IRCTC Ticket Window Deque Maximum
IRCTC Ticket Window Deque Maximum
MediumQueues100% accepted
IRCTC booking counts per window. Given array and window size k, return the maximum booking count in each sliding window of size k using a deque.
Approach
Find maximum of every k-size window using a monotonic deque.
Input
8 3
1 3 -1 -3 5 3 6 7
Output
[3,3,5,5,6,7]
More Queues 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