title: Find Pair With Greatest Product In Array
signature: pub fn find_pair_with_greatest_product_in_array(arr: Vec<i32>, n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr: Vec<i32>, n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr, n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([4, 78, 84]), 2, 
        -1
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([-54, 64, 60, 14, 18, -68, -54, -58, 38, -72, -84, 46, 74, 76, 28, -2, 54, 24, 18, -74, -78, 14, -38, -70, 26, -54, -36, -96, -12, 8, 62, -42, -84, 10, -6, 36, -72, 10, 10, -20, 16, 92, -64, -34, 74, -98, 18]), 26, 
        76
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([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]), 22, 
        1
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([39, 49, 94, 80, 48, 34, 63, 82, 47, 51, 60, 68, 79, 23, 97, 22, 54, 53, 40, 2, 25]), 10, 
        -1
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-90, -52, -10, 12, 72]), 3, 
        -1
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([1, 0, 0]), 2, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([2, 9, 11, 14, 16, 17, 17, 18, 19, 21, 24, 25, 28, 29, 30, 33, 33, 39, 41, 41, 43, 46, 50, 51, 60, 62, 67, 80, 84, 86, 91, 92, 97]), 27, 
        60
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([4]), 0, 
        -1
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([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]), 16, 
        1
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([52, 8, 31, 92, 20, 18, 34, 5, 15, 8, 73, 20, 40, 61, 80, 51, 95, 73, 38, 30, 21, 69, 52, 38, 68, 77]), 22, 
        40
      ));
      
  }
source_py: def find_pair_with_greatest_product_in_array(arr, n):
      result = (- 1)
      for i in range(n):
          for j in range((n - 1)):
              for k in range((j + 1), n):
                  if ((arr[j] * arr[k]) == arr[i]):
                      result = max(result, arr[i])
      return result
source_cpp: int find_pair_with_greatest_product_in_array(vector<int> arr, int n) {
    int result = - 1;
    for ( int i = 0;
    i < n;
    i ++ ) for ( int j = 0;
    j < n - 1;
    j ++ ) for ( int k = j + 1;
    k < n;
    k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = max ( result, arr [ i ] );
    return result;
  }