0e|insr|“`
Image: www.hopefornigeriaonline.com
'''
Given an array of integers arr[] of size N and a positive integer K. Find the maximum sum of a subarray of size K.
Examples :
Input : arr[] = 100, 200, 300, 400, K = 2
Output : 700
Input : arr[] = 1, 4, 2, 10, 23, 3, 1, 0, K = 4
Output : 39
We get maximum sum by adding subarray 4, 2, 10, 23 of size 4.
'''
# Python3 code to demonstrate working of
# Maximum sum subarray of size K
# Using sliding window technique
# Function to find maximum sum subarray
def maxSubArraySum(arr, n, k):
# Initialize window sum and maximum sum
window_sum = sum(arr[:k])
max_sum = window_sum
# Slide the window and update the maximum sum
for i in range(k, n):
window_sum = window_sum - arr[i - k] + arr[i]
max_sum = max(max_sum, window_sum)
# Return the maximum sum
return max_sum
# Driver code
arr = [100, 200, 300, 400]
n = len(arr)
k = 2
print("Maximum sum of a subarray of size", k, "is", maxSubArraySum(arr, n, k))
```The provided Python code is designed to find the maximum sum of a subarray of a given size `K` within an array `arr`. Here's a step-by-step breakdown of how it works:
1. It initializes a variables `window_sum` to hold the sum of the first `k` elements in the array. It also initializes a variable `max_sum` to the value of `window_sum`. This represents the maximum sum found so far.
2. The code enters a loop that iterates from index `k` to `n-1`. In each iteration, it:
- Subtracts the element at index `i - k` (the leftmost element of the current window) from `window_sum` to move the window to the right.
- Adds the element at index `i` (the rightmost element of the new window) to `window_sum`.
- Updates `max_sum` to the maximum of its current value and the updated `window_sum`. This ensures that it tracks the maximum sum found so far.
3. After the loop completes, the function returns `max_sum`, which represents the maximum sum of a subarray of size `k`.
This algorithm utilizes a sliding window technique, which makes the computation more efficient by gradually moving the window and updating the sum, rather than recalculating the sum for every possible subarray of size `k`.
Image: www.twinkl.jp
What Are The 3 Largest Trade Unions In South Africa
