title: Longest Subarray Count 1S One Count 0S
signature: function longestSubarrayCount1SOneCount0S($arr, $n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($arr, $n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($arr, $n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        array(6, 10, 31, 35), 2, 
        1));
      
      printf("TEST-1...%s\n",driver(
        array(4, 88, -72, 28, -54, 32, -34), 6, 
        5));
      
      printf("TEST-2...%s\n",driver(
        array(0, 0, 0, 1, 1, 1, 1, 1, 1), 4, 
        1));
      
      printf("TEST-3...%s\n",driver(
        array(39, 22, 15, 10, 34, 87, 46, 83, 74, 77, 61, 90, 43, 67, 64, 72, 92, 52, 68, 53, 67, 32, 82, 76, 76, 47, 74, 47, 8, 80, 85, 58, 75), 26, 
        9));
      
      printf("TEST-4...%s\n",driver(
        array(-82, -58, -50, -30, -14, -4, -2, -2, 0, 22, 36, 58, 70, 80, 80, 82, 84, 90), 14, 
        11));
      
      printf("TEST-5...%s\n",driver(
        array(1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1), 7, 
        7));
      
      printf("TEST-6...%s\n",driver(
        array(4, 11, 17, 21, 21, 22, 30, 31, 36, 37, 39, 40, 45, 46, 47, 48, 52, 53, 53, 60, 60, 65, 66, 66, 67, 67, 87, 88, 91, 97), 29, 
        9));
      
      printf("TEST-7...%s\n",driver(
        array(-4, -60, -78, -50, 64, 18, 0, 76, 12, 86, -22), 7, 
        6));
      
      printf("TEST-8...%s\n",driver(
        array(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1), 17, 
        3));
      
      printf("TEST-9...%s\n",driver(
        array(4, 39, 50, 37, 71, 66, 55, 34, 1, 41, 34, 99, 69, 31), 11, 
        9));
      
  }
  
  main();
  ?>
source_py: def longest_subarray_count_1s_one_count_0s(arr, n):
      um = {i: 0 for i in range(10)}
      sum = 0
      maxLen = 0
      for i in range(n):
          if (arr[i] == 0):
              sum += (- 1)
          else:
              sum += 1
          if (sum == 1):
              maxLen = (i + 1)
          elif (sum not in um):
              um[sum] = i
          if ((sum - 1) in um):
              if (maxLen < (i - um[(sum - 1)])):
                  maxLen = (i - um[(sum - 1)])
      return maxLen
source_cpp: int longest_subarray_count_1s_one_count_0s(vector<int> arr, int n) {
    unordered_map < int, int > um;
    int sum = 0, maxLen = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      sum += arr [ i ] == 0 ? - 1 : 1;
      if ( sum == 1 ) maxLen = i + 1;
      else if ( um . find ( sum ) == um . end ( ) ) um [ sum ] = i;
      if ( um . find ( sum - 1 ) != um . end ( ) ) {
        if ( maxLen < ( i - um [ sum - 1 ] ) ) maxLen = i - um [ sum - 1 ];
      }
    }
    return maxLen;
  }