Given an array of integers (A[]) and a number x, find the smallest subarray with sum greater than the given value.

Author: sachuverma

DSA Crack Sheet/README.md

@@ -31,6 +31,7 @@
 - [Triplet Sum in Array](https://practice.geeksforgeeks.org/problems/triplet-sum-in-array-1587115621/1# "view question") - [Cpp Solution](./solutions/Triplet%20Sum%20in%20Array.cpp)  
 - [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water-1587115621/1# "view question") - [Cpp Solution](./solutions/Trapping%20Rain%20Water.cpp)  
 - [Chocolate Distribution Problem](https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0# "view question") - [Cpp Solution](./solutions/Chocolate%20Distribution%20Problem.cpp)  
+- [Smallest subarray with sum greater than x](https://practice.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x5651/1# "view question") - [Cpp Solution](./solutions/Smallest%20subarray%20with%20sum%20greater%20than%20x.cpp)  
 - []( "view question") - [Cpp Solution](./solutions/.cpp)  
 
 <!-- - []( "view question") - [Cpp Solution](./solutions/) -->

DSA Crack Sheet/solutions/Smallest subarray with sum greater than x.cpp

@@ -0,0 +1,58 @@
+/*
+Smallest subarray with sum greater than x
+==========================================
+
+Given an array of integers (A[])  and a number x, find the smallest subarray with sum greater than the given value.
+
+Note: The answer always exists. It is guaranteed that x doesn't exceed the summation of a[i] (from 1 to N).
+
+Example 1:
+Input:
+A[] = {1, 4, 45, 6, 0, 19}
+x  =  51
+Output: 3
+Explanation:
+Minimum length subarray is 
+{4, 45, 6}
+
+Example 2:
+Input:
+A[] = {1, 10, 5, 2, 7}
+  x  = 9
+Output: 1
+Explanation:
+Minimum length subarray is {10}
+
+Your Task:  
+You don't need to read input or print anything. Your task is to complete the function sb() which takes the array A[], its size N and an integer X as inputs and returns the required ouput.
+
+Expected Time Complexity: O(N)
+Expected Auxiliary Space: O(1)
+
+Constraints:
+1 ≤ N, x ≤ 105
+1 ≤ A[] ≤ 104
+*/
+
+int sb(int arr[], int n, int x)
+{
+  int curr_sum = 0, min_len = n + 1;
+  int start = 0, end = 0;
+
+  while (end < n)
+  {
+    while (curr_sum <= x && end < n)
+    {
+      curr_sum += arr[end];
+      end++;
+    }
+
+    while (curr_sum > x && start < n)
+    {
+      min_len = min(min_len, end - start);
+      curr_sum -= arr[start];
+      start++;
+    }
+  }
+  return min_len;
+}