Day 100 of 100 days dsa coding challenge

🔥 100 Days Completed! 🔥
Taking on the GeeksforGeeks POTD challenge has been one of the best decisions — 100 days of consistency, learning, debugging, and levelling up! 💻🚀

From tricky edge cases to satisfying ACs, every day taught me something new.
Here’s to staying consistent and growing further — one problem at a time! 💪✨

100DaysOfCode #CodingChallenge #ProblemSolving #GeeksforGeeks #DeveloperJourney

Problem:

https://www.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1

K Sized Subarray Maximum
Difficulty: Medium Accuracy: 26.04%
Given an array arr[] of positive integers and an integer k. You have to find the maximum value for each contiguous subarray of size k. Return an array of maximum values corresponding to each contiguous subarray.

Examples:
Input: arr[] = [1, 2, 3, 1, 4, 5, 2, 3, 6], k = 3
Output: [3, 3, 4, 5, 5, 5, 6]
Explanation:
1st contiguous subarray [1, 2, 3], max = 3
2nd contiguous subarray [2, 3, 1], max = 3
3rd contiguous subarray [3, 1, 4], max = 4
4th contiguous subarray [1, 4, 5], max = 5
5th contiguous subarray [4, 5, 2], max = 5
6th contiguous subarray [5, 2, 3], max = 5
7th contiguous subarray [2, 3, 6], max = 6

Input: arr[] = [5, 1, 3, 4, 2], k = 1
Output: [5, 1, 3, 4, 2]
Explanation: When k = 1, each element in the array is its own subarray, so the output is simply the same array
Constraints:
1 ≤ arr.size() ≤ 106
1 ≤ k ≤ arr.size()
0 ≤ arr[i] ≤ 109

Solution:
from collections import deque

class Solution:
def maxOfSubarrays(self, arr, k):
dq = deque()
res = []

    for i in range(len(arr)):
        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:
            res.append(arr[dq[0]])

    return res