Sliding Window

Problem You are given an array of size N and an integer K. Your task:Find the maximum sum of any subarray of size exactly K Understanding the Problem Let’s take an example: arr = [2, 1, 5, 1, 3, 2] k