title: Smallest Sum Contiguous Subarray
signature: def smallest_sum_contiguous_subarray(arr, n):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(arr, n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              arr, n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver([2, 9, 13, 14, 15, 18, 19, 19, 25, 26, 29, 29, 29, 30, 31, 36, 37, 37, 38, 39, 39, 40, 40, 42, 42, 46, 50, 53, 58, 60, 62, 64, 65, 67, 68, 69, 72, 77, 78, 83, 85, 89, 90, 93, 95, 95, 97], 24, 2)
      print(f"TEST-0...{result}")
  
      result = driver([14, -58, 8, 78, -26, -20, -60, 42, -64, -12], 6, -58)
      print(f"TEST-1...{result}")
  
      result = driver([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], 8, 0)
      print(f"TEST-2...{result}")
  
      result = driver([44, 88, 20, 47, 69, 42, 26, 49, 71, 91, 18, 95, 9, 66, 60, 37, 47, 29, 98, 63, 15, 9, 80, 66, 1, 9, 57, 56, 20, 2, 1], 26, 1)
      print(f"TEST-3...{result}")
  
      result = driver([-78, -64, -62, -60, -52, 4, 8, 46, 72, 74], 8, -316)
      print(f"TEST-4...{result}")
  
      result = driver([0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1], 11, 0)
      print(f"TEST-5...{result}")
  
      result = driver([3, 7, 16, 17, 23, 23, 23, 28, 29, 30, 34, 38, 40, 41, 43, 43, 44, 46, 51, 51, 51, 55, 57, 58, 61, 62, 66, 66, 67, 69, 70, 73, 75, 77, 79, 80, 85, 85, 87, 87, 93, 96], 38, 3)
      print(f"TEST-6...{result}")
  
      result = driver([80, 22, 38, 26, 62, -48, -48, 46, -54, 4, 76, 46, 48, 40, -92, -98, -88, 12, -42, -94, 76, -16, -82, 62, 18, -24], 22, -402)
      print(f"TEST-7...{result}")
  
      result = driver([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], 13, 0)
      print(f"TEST-8...{result}")
  
      result = driver([85, 44, 1, 97, 50, 74, 62, 90, 3, 78, 8, 48, 96, 41, 36, 91, 57, 97, 85, 90, 78, 43, 28, 92, 85, 59, 29, 38, 34, 65, 20, 26, 27, 23, 71, 22, 47, 99, 68, 93, 67, 66, 69, 82, 98, 15, 44, 51, 65], 45, 1)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
source_py: def smallest_sum_contiguous_subarray(arr, n):
      min_ending_here = sys.maxsize
      min_so_far = sys.maxsize
      for i in range(n):
          if (min_ending_here > 0):
              min_ending_here = arr[i]
          else:
              min_ending_here += arr[i]
          min_so_far = min(min_so_far, min_ending_here)
      return min_so_far
source_cpp: int smallest_sum_contiguous_subarray(vector<int> arr, int n) {
    int min_ending_here = INT_MAX;
    int min_so_far = INT_MAX;
    for ( int i = 0;
    i < n;
    i ++ ) {
      if ( min_ending_here > 0 ) min_ending_here = arr [ i ];
      else min_ending_here += arr [ i ];
      min_so_far = min ( min_so_far, min_ending_here );
    }
    return min_so_far;
  }