Your question is Sliding Window Maximum. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
HPE Ezmeral telemetry processing may need the peak value in each consecutive window of a large numeric stream. Given an integer array and a fixed window size, return the maximum value from every window as it moves one position at a time.
Implement max_sliding_window(nums, k).
nums, a non-empty list of integers, and k, an integer window size.i is the maximum of nums[i:i+k].k - 1 elements.The solution should avoid rescanning all k elements for every window because the array may be very large.
def max_sliding_window(nums, k):