Given an array of integers and a number k, where 1 <= k <= length of the array, compute the maximum values of each subarray of length k.

Daily_coding_Problem_18.py

'''
For example, given array = [10, 5, 2, 7, 8, 7] and k = 3, we should get: [10, 7, 8, 8], since:
  10 = max(10, 5, 2)
  7 = max(5, 2, 7)
  8 = max(2, 7, 8)
  8 = max(7, 8, 7)
'''
from collections import deque 
def largest_subarray(arr,n,k): 
    '''
    arr(list):list of array elements
    n(int):size of array
    k(int):subarray size
    '''
    dq=deque() 
    for i in range(k): 
        while dq and arr[i] >= arr[dq[-1]] : 
            dq.pop() 
        dq.append(i); 
    for i in range(k,n): 
        print(arr[dq[0]]) 
        while dq and dq[0] <= i-k:  
            dq.popleft()  
        while dq and arr[i] >= arr[dq[-1]] : 
            dq.pop() 
        dq.append(i) 
    print(arr[dq[0]])