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

// Class to encapsulate the subarray logic
class SubarraySolver {
public:
    // Method to find the longest subarray with sum equal to k
    int getLongestSubarray(vector<int>& a, int k) {
        int n = a.size(); // Total number of elements
        int len = 0;      // Variable to store the max length found

        // Outer loop: pick every possible starting index
        for (int i = 0; i < n; i++) {
            int s = 0; // Reset sum for each new starting index

            // Inner loop: extend the subarray from the current start
            for (int j = i; j < n; j++) {
                s += a[j]; // Add current element to the ongoing sum

                // If current sum equals target, update the max length
                if (s == k) {
                    len = max(len, j - i + 1);
                }
            }
        }
        return len; // Return the maximum length found
    }
};

int main() {
    vector<int> a = { -1, 1, 1 };
    int k = 1;

    SubarraySolver solver;
    int len = solver.getLongestSubarray(a, k);

    cout << "The length of the longest subarray is: " << len << "\n";
    return 0;
}
import java.util.*;
class SubarraySolver {
// Method to find the longest subarray whose sum equals k
    public int getLongestSubarray(int[] a, int k) {
        int n = a.length; // Total number of elements in the array
        int maxLen = 0;   // Variable to store the maximum length found

        // Outer loop to select the starting index of the subarray
        for (int i = 0; i < n; i++) {
            int sum = 0; // Reset sum for each new starting index

            // Inner loop to extend the subarray from the starting index 'i'
            for (int j = i; j < n; j++) {
                sum += a[j]; // Incrementally add elements to the sum

                // If the current subarray sum equals k
                if (sum == k) {
                    // Calculate the length of the subarray (j - i + 1)
                    // Update maxLen if this subarray is longer
                    maxLen = Math.max(maxLen, j - i + 1);
                }
            }
        }

        return maxLen; // Return the maximum length foun