Code Room
CodingHard
Question
Given an integer array nums and a window size k, return a list of the maximum value in each contiguous window of size k as the window slides from left to right. The array has 1 to 10^5 elements, values fit in 32-bit signed range, and 1 <= k <= len(nums). You should aim for O(n) overall.
Implement
max_sliding_window(nums: list[int], k: int) → list[int]Examples
in
[[1,3,-1,-3,5,3,6,7],3]out[3,3,5,5,6,7]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.