13141516171819202122232425262728293031323334353637383940414243444546474849

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to find the maximum sum of any subarray of size k
    int findMaxConsSum(int arr[], int n, int k) {
        // Initialize the maximum sum to the smallest possible integer
        int maxSum = INT_MIN;

        // Loop through the array until the (n - k)th element
        for (int i = 0; i <= n - k; i++) {
            // Initialize current sum for this window
            int currSum = 0;

            // Loop through the next k elements to calculate window sum
            for (int j = 0; j < k; j++) {
                currSum = currSum + arr[i + j];
            }

            // Update the maximum sum if current window has a higher sum
            maxSum = max(maxSum, currSum);
        }

        // Return the maximum sum found
        return maxSum;
    }
};

// Driver code
int main() {
    // Input array
    int arr[] = {1, 7, 6, 2, 3, 4, 5};

    // Size of the array
    int n = 7;

    // Size of the sliding window
    int k = 2;

    // Create an object of the Solution class
    Solution sol;

    // Call the function and print the result
    cout << sol.findMaxConsSum(arr, n, k) << endl;

    return 0;
}

123456789101112131415161718192021222324252627282930313233343536373839404142

import.java.util.*;
public class Solution {

    // Function to find the maximum sum of any subarray of size k
    public static int findMaxConsSum(int[] arr, int n, int k) {
        // Variable to keep track of the maximum sum
        int maxSum = Integer.MIN_VALUE;

        // Loop through each possible starting point of a window of size k
        for (int i = 0; i <= n - k; i++) {
            // Variable to store the current window sum
            int currSum = 0;

            // Sum up the elements in the current window
            for (int j = 0; j < k; j++) {
                currSum += arr[i + j];
            }

            // Update maxSum if the current window sum is greater
            maxSum = Math.max(maxSum, currSum);
        }

        // Return the maximum window sum found
        return maxSum;
    }

    // Driver code
    public static void main(String[] args) {
        // Input array
        int[] arr = {1, 7, 6, 2, 3, 4, 5};

        // Length of the array
        int n = arr.length;

        // Size of the sliding window
        int k = 2;

        // Output the result
        System.out.println(findMaxConsSum(arr, n, k));
    }
}

123456789101112<