Sliding window max min
Given an integer array nums and window size k (1 <= k <= len(nums)), for every contiguous window of size k compute (window max - window min) and return these values left to right. There are len(nums)-k+1 windows. Aim for O(n) total time rather than O(n*k).
Implement
max_range_in_windows(nums: list[int], k: int) → list[int]Examples
in
[[1,3,-1,-3,5,3,6,7],3]out[4,6,8,8,3,4]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.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,3,-1,-3,5,3,6,7],3][4,6,8,8,3,4]not run yetsample