Difference between max and min in every window of size k in an array (deque)
Asked in the Extra DSA round stage. Given an integer array nums and window size k, return the difference between the maximum and minimum value for every contiguous window of size k.
Input: nums, a list of integers, and k, an integer.
Output: A list containing one max(window) - min(window) value for each window, from left to right.
Examples:
nums = [4, 2, 12, 3], k = 2 outputs [2, 10, 9].nums = [1, 1, 1], k = 3 outputs [0].Constraints: 1 <= k <= len(nums) <= 10^5; -10^9 <= nums[i] <= 10^9.
def window_max_min_difference(nums, k):