HTMLify
maximum-of-all-subarrays-of-size-k.py
Views: 4 | Author: prakhardoneria
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | from collections import deque class Solution: def maxOfSubarrays(self, arr, k): n = len(arr) dq = deque() result = [] for i in range(n): if dq and dq[0] == i - k: dq.popleft() while dq and arr[dq[-1]] <= arr[i]: dq.pop() dq.append(i) if i >= k - 1: result.append(arr[dq[0]]) return result |