How to solve Sliding Window algorithm questions | Max subarray of size k

In many problems dealing with an array (or a LinkedList), we are asked to find or calculate something among all the contiguous subarrays (or sublists) of a given size. We can solve this kind of problem using a sliding window technique.

In a sliding window technique, we move/shrink/expand our window based on the question given. In this video, I will explain this technique in-depth and where to use this technique.

I will be explaining these techniques in depth with appropriate examples.

#slidinigWindow
#algorithms
#maxSubArrayOfSizeK