Window range monotonic deque
Given an array nums and window size k, return for each window of size k the difference between the window's maximum and minimum (its range). Do it in O(n) using monotonic deques. The array length is >= k >= 1.
Implement
sliding_window_range(nums: list[int], k: int) → list[int]Examples
in
[[1,3,6,2,5],3]out[5,4,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,6,2,5],3][5,4,4]not run yetsample