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

Given an array of integers and a target sum, find a contiguous subarray with the sum equal to the target.

Iterate through the array while keeping track of the current sum and start index.
Use a hashmap to store the cumulative sum and its corresponding index.
If the difference between the current sum and the target is found in the hashmap, return the indices.
Handle edge cases like when the target sum is 0 or when no subarray is found.

Asked in Persistent Systems