Rahul and Minimum Subarray Challenge

Rahul, who is passionate about programming, is learning about arrays and lists. He faces a challenging problem to determine the smallest subarray length in a given array 'ARR' of size 'N', where the subarray's sum exceeds a specified value 'X'. If such a subarray does not exist, the function should return 0.

Example:

Input:

ARR = [1, 2, 21, 7, 6, 12], X = 23

Output:

2

Explanation:

The smallest subarray with a sum greater than 'X' is [21, 7], with a length of 2. Although there are other subarrays, such as [1, 2, 21] and [7, 6, 12], this is the smallest possible.

Constraints:

1 ≤ T ≤ 10^2

1 ≤ N ≤ 10^3

1 ≤ X ≤ 10^9

0 ≤ A[i] ≤ 10^9

Question

Rahul and Minimum Subarray Challenge

Rahul, who is passionate about programming, is learning about arrays and lists. He faces a challenging problem to determine the smallest subarray length in a given array 'ARR' of size 'N', where the subarray's sum exceeds a specified value 'X'. If such a subarray does not exist, the function should return 0.

Example:

Input:

ARR = [1, 2, 21, 7, 6, 12], X = 23

Output:

Explanation:

The smallest subarray with a sum greater than 'X' is [21, 7], with a length of 2. Although there are other subarrays, such as [1, 2, 21] and [7, 6, 12], this is the smallest possible.

Constraints:

1 ≤ T ≤ 10^2
1 ≤ N ≤ 10^3
1 ≤ X ≤ 10^9
0 ≤ A[i] ≤ 10^9

Accepted Answer

The problem is to find the length of the smallest subarray in a given array with its sum greater than a given value.

Iterate through the array and keep track of the current subarray sum
If the current sum becomes greater than the given value, update the minimum subarray length
If the current sum becomes negative, reset the sum and start a new subarray
Return the minimum subarray length