title: Integer Positive Value Positive Negative Value Array
signature: function integer_positive_value_positive_negative_value_array(arr, n)
test_code: 
  
  -- SOLUTION CODE
  -- ============================================
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  function isCorrect(actual, expected)
      if type(expected) ~= type(actual) then
          return false
      end
      
      if type(expected) == 'table' then
          for k,v_expected in pairs(expected) do
              
              if actual[k] == nil then
                  return false
              end
              local v_actual = actual[k]
              if not isCorrect(v_actual, v_expected) then
                  return false
              end
              actual[k]=nil
          end
      
          if next(actual) then 
              return false
          end
          return true
      else
          return actual == expected
      end
  end
  
  function validateSolution(actual, expected)
      return isCorrect(actual,expected)
  end
  
  function driver(arr, n, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(arr, n) 
      end)
      if status then
          if validateSolution(exec_result,expected) then
              return "PASSED"
          end
          return "FAILED"
      else
          return string.format("ERROR=%s",string.gsub(error_msg,".*:[%d]+: ",""))
      end
  end
      
  function main()
      result = driver({1, 7, 10, 14, 15, 24, 27, 32, 33, 38, 39, 40, 42, 42, 47, 58, 75, 76, 78, 79, 83, 85, 89, 96}, 18, 1)
      print(string.format("TEST-0...%s",result))
  
      result = driver({-36, 14, -76, -70, 52, 18, 64}, 5, 14)
      print(string.format("TEST-1...%s",result))
  
      result = driver({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 17, 0)
      print(string.format("TEST-2...%s",result))
  
      result = driver({35, 50, 36, 50, 82, 54, 10, 45, 13, 22, 1, 41, 13, 11, 4, 43, 50, 27, 94, 57}, 15, 35)
      print(string.format("TEST-3...%s",result))
  
      result = driver({-88, -86, -84, -80, -80, -74, -72, -48, -46, -46, -44, -34, -32, -24, -22, -14, 4, 4, 8, 8, 10, 12, 20, 20, 24, 24, 24, 28, 32, 34, 36, 44, 46, 54, 54, 60, 62, 62, 62, 70, 70, 80, 88, 88, 90}, 27, 4)
      print(string.format("TEST-4...%s",result))
  
      result = driver({0, 0}, 1, 0)
      print(string.format("TEST-5...%s",result))
  
      result = driver({1, 1, 3, 6, 6, 8, 12, 13, 17, 27, 28, 31, 40, 40, 42, 43, 53, 55, 58, 60, 60, 61, 65, 66, 72, 72, 75, 80, 84, 89, 96, 97, 99}, 31, 1)
      print(string.format("TEST-6...%s",result))
  
      result = driver({52, -38, -82, 30, -66, 42, 54, -96, -46, -30, 18, -50, 96, 90, 4, 74, -22, 8, 34, 74, -46, 8, -32, 88, -96, 26, -80, 50, 92, -80, 44, 36}, 24, 52)
      print(string.format("TEST-7...%s",result))
  
      result = driver({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}, 16, 0)
      print(string.format("TEST-8...%s",result))
  
      result = driver({38, 20, 54, 51, 11, 61, 90, 28, 23, 55, 65, 87, 99, 70, 74, 3, 68, 23, 74, 53, 80, 7, 57, 24, 66, 8, 15, 63, 18, 67, 96, 31, 63, 50}, 30, 38)
      print(string.format("TEST-9...%s",result))
  
  end
  
  main()
source_py: def integer_positive_value_positive_negative_value_array(arr, n):
      hash = dict()
      maximum = 0
      for i in arr:
          if (i < 0):
              if (abs(i) not in hash.keys()):
                  hash[abs(i)] = (- 1)
              else:
                  hash[abs(i)] -= 1
          else:
              hash[i] = (hash.get(i, 0) + 1)
      for i in arr:
          if ((i in hash.keys()) and (hash[i] > 0)):
              return i
      return (- 1)
source_cpp: int integer_positive_value_positive_negative_value_array(vector<int> arr, int n) {
    unordered_map < int, int > hash;
    int maximum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      if ( arr [ i ] < 0 ) hash [ abs ( arr [ i ] ) ] -= 1;
      else hash [ arr [ i ] ] += 1;
    }
    for ( int i = 0;
    i < n;
    i ++ ) if ( hash [ arr [ i ] ] != 0 ) return arr [ i ];
    return - 1;
  }