Subarray With Given Sum Problem Statement

Given an array ARR of N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exists, return the start and end indices (0-based index) of the subarray. If no such subarray is found, return [-1, -1].

Example:

Input:

T = 1
N = 4, S = 7
ARR = [1, 2, 3, 4]

Output:

[0, 2]

Explanation:

The subarray [1, 2, 3] has a sum equal to S (7).

Constraints:

1

Question

Subarray With Given Sum Problem Statement

Given an array ARR of N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exists, return the start and end indices (0-based index) of the subarray. If no such subarray is found, return [-1, -1].

Example:

Input:

T = 1
N = 4, S = 7
ARR = [1, 2, 3, 4]

Output:

[0, 2]

Explanation:

The subarray [1, 2, 3] has a sum equal to S (7).

Constraints:

1 <= T <= 10
1 <= N <= 10^5
-10^14 <= S <= 10^14
-10^9 <= ARR[i] <= 10^9
Time Limit: 1 sec

Note: If multiple such subarrays exist, returning any one is sufficient.

Accepted Answer

The problem involves finding a contiguous subarray within an array with a given sum.

Iterate through the array while keeping track of the sum of elements encountered so far.
Use a hashmap to store the cumulative sum and its corresponding index.
If the current sum minus the target sum is found in the hashmap, a subarray with the target sum exists.
Return the start and end indices of the subarray if found, else return [-1, -1].