title: Minimum Length Subarray Sum Greater Given Value 1
signature: function minimumLengthSubarraySumGreaterGivenValue1($arr, $n, $x) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($arr, $n, $x, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($arr, $n, $x), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        array(2, 4, 5, 10, 14, 15, 16, 20, 23, 28, 31, 35, 36, 36, 43, 48, 49, 55, 57, 57, 58, 61, 64, 64, 68, 70, 70, 73, 74, 76, 76, 77, 81, 81, 82, 87, 89, 92, 99), 33, 28, 
        1));
      
      printf("TEST-1...%s\n",driver(
        array(66, -20, 12, -48, 22, 28, 40, -30, -6, -96, 10, -88, 40), 11, 12, 
        1));
      
      printf("TEST-2...%s\n",driver(
        array(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), 42, 23, 
        43));
      
      printf("TEST-3...%s\n",driver(
        array(28, 19, 38, 31, 17, 27, 60, 35, 19, 47, 34, 51, 3, 95, 33, 29, 84, 46, 74, 87), 15, 15, 
        1));
      
      printf("TEST-4...%s\n",driver(
        array(-48, -2), 1, 1, 
        2));
      
      printf("TEST-5...%s\n",driver(
        array(1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1), 12, 15, 
        13));
      
      printf("TEST-6...%s\n",driver(
        array(1, 4, 4, 6, 8, 10, 12, 12, 13, 15, 18, 20, 21, 23, 25, 28, 28, 33, 33, 35, 35, 36, 37, 38, 42, 44, 63, 63, 65, 65, 65, 66, 70, 74, 77, 78, 80, 80, 84, 87, 87, 89, 92, 93, 94, 97, 98, 99), 42, 27, 
        1));
      
      printf("TEST-7...%s\n",driver(
        array(-82, -12, -40, 58, 22, -76, -94, -28, 42, 36, 64), 10, 6, 
        1));
      
      printf("TEST-8...%s\n",driver(
        array(0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1), 10, 14, 
        11));
      
      printf("TEST-9...%s\n",driver(
        array(76, 65, 96, 76, 1, 91, 22, 29, 95, 21, 73, 68, 30, 52, 73, 86, 52, 66, 67, 37, 76, 53, 68, 6, 95, 81, 98, 42, 63, 38, 92, 78, 59, 86, 10, 38, 18, 15, 52, 62, 16, 66), 23, 35, 
        1));
      
  }
  
  main();
  ?>
source_py: def minimum_length_subarray_sum_greater_given_value_1(arr, n, x):
      curr_sum = 0
      min_len = (n + 1)
      start = 0
      end = 0
      while (end < n):
          while ((curr_sum <= x) and (end < n)):
              if ((curr_sum <= 0) and (x > 0)):
                  start = end
                  curr_sum = 0
              curr_sum += arr[end]
              end += 1
          while ((curr_sum > x) and (start < n)):
              if ((end - start) < min_len):
                  min_len = (end - start)
              curr_sum -= arr[start]
              start += 1
      return min_len
source_cpp: int minimum_length_subarray_sum_greater_given_value_1(vector<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 ) {
        if ( curr_sum <= 0 && x > 0 ) {
          start = end;
          curr_sum = 0;
        }
        curr_sum += arr [ end ++ ];
      }
      while ( curr_sum > x && start < n ) {
        if ( end - start < min_len ) min_len = end - start;
        curr_sum -= arr [ start ++ ];
      }
    }
    return min_len;
  }