Code Room
CodingMedium
Question
Given an array and a window size k, return a list of the maximum value within each contiguous window of size k as the window slides from left to right. Constraints: 1 <= k <= n <= 10^5, -10^4 <= nums[i] <= 10^4. There are exactly n - k + 1 windows.
Implement
sliding_max(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.