title: Find Subarray With Given Sum
signature: function findSubarrayWithGivenSum(arr: Array<number>, n: number, sum: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(arr: Array<number>, n: number, sum: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n, sum),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([4, 8, 8, 10, 15, 18, 19, 22, 25, 26, 30, 32, 35, 36, 40, 41, 43, 48, 53, 57, 59, 63, 64, 68, 71, 76, 76, 77, 78, 89, 96, 97], 26, 23, 0);
    console.log(`TEST-0...${result}`);
  
    result = driver([-78, 16, -16, -10, -2, -38, 58, -72, -78, 50, -68, -16, -96, 82, 70, 2, -20], 9, 12, 0);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], 9, 11, 0);
    console.log(`TEST-2...${result}`);
  
    result = driver([16, 10, 55, 43, 46, 74, 57, 65, 86, 60, 28, 6, 92], 10, 6, 0);
    console.log(`TEST-3...${result}`);
  
    result = driver([-98, -98, -90, -84, -84, -80, -76, -76, -70, -54, -48, -46, -44, -42, -38, -14, -12, -4, 6, 8, 24, 28, 32, 40, 40, 42, 64, 84, 98], 23, 19, 0);
    console.log(`TEST-4...${result}`);
  
    result = driver([0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], 12, 8, 0);
    console.log(`TEST-5...${result}`);
  
    result = driver([2, 10, 40, 45, 56, 66, 66, 70, 75, 83, 93, 98], 10, 10, 1);
    console.log(`TEST-6...${result}`);
  
    result = driver([-20, 30, 56, -68, 54, -6, 78, -86, 88, -66, 76, -66, 62, 78, 22, 46, -94, -10, 18, 16, -36, 34, -98, -84, -40, 98, 82, 10, 12, 54, -88], 30, 17, 0);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 0, 1, 1], 2, 2, 0);
    console.log(`TEST-8...${result}`);
  
    result = driver([38, 24, 12], 1, 1, 0);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def find_subarray_with_given_sum(arr, n, sum):
      for i in range(n):
          curr_sum = arr[i]
          j = (i + 1)
          while (j <= n):
              if (curr_sum == sum):
                  print('Sum found between')
                  print(('indexes %d and %d' % (i, (j - 1))))
                  return 1
              if ((curr_sum > sum) or (j == n)):
                  break
              curr_sum = (curr_sum + arr[j])
              j += 1
      print('No subarray found')
      return 0
source_cpp: int find_subarray_with_given_sum(vector<int> arr, int n, int sum) {
    int curr_sum, i, j;
    for ( i = 0;
    i < n;
    i ++ ) {
      curr_sum = arr [ i ];
      for ( j = i + 1;
      j <= n;
      j ++ ) {
        if ( curr_sum == sum ) {
          return 1;
        }
        if ( curr_sum > sum || j == n ) break;
        curr_sum = curr_sum + arr [ j ];
      }
    }
    return 0;
  }