This is the first instalment of the pattern Sliding Window
Problem Name -
Maximum Sum Subarray of Size K (easy)
Find the maximum (or minimum) sum of a subarray of size k
Problem Link - https://www.geeksforgeeks.org/find-ma...
If you don't understand anything, please leave a comment and let me know. I will try my best to help!