Available question text
Given an array and window size k, return the median of each sliding window as it moves right by one. The core challenge is maintaining the median under online insertions and deletions efficiently (O(log k) per update) for n up to 1e5—typically solved with two heaps or a balanced multiset—and for even k the median is the average of the two middle values.
Related questions
Continue with questions that share topics or the same question type.
- Design a Sliding-Window Event Stream Processor with Checksum Validation and Average Payload Length
Coding
- 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
- Implement a rate limiter using the sliding window log algorithm
Coding
- Leetcode Hard question: Sliding Window Maximum
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
Meta
Leetcode 480. Sliding Window Median
Reported Oct 1, 2026 · 14 source reports
MANAGER, MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View sourceMicrosoft
Leetcode 480. Sliding Window Median
Reported Feb 26, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceSpotify
Leetcode 480. Sliding Window Median
Reported Jun 28, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source