Available question text
Leetcode Hard question: Sliding Window Maximum
Related questions
Continue with questions that share topics or the same question type.
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Leetcode medium sliding window question
Coding
- Sliding Window Maximum
Coding · Array · Heap (Priority Queue) · Monotonic Queue
- 1 leetcode hard complex dp questions
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Microsoft
Leetcode Hard question: Sliding Window Maximum
Reported Jun 2026 · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source