title: Remove Minimum Number Elements No Common Element Exist Array
signature: pub fn remove_minimum_number_elements_no_common_element_exist_array(a: Vec<i32>, b: Vec<i32>, n: i32, m: 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(a: Vec<i32>, b: Vec<i32>, n: i32, m: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(a, b, n, m), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([4, 7, 10, 12, 12, 24, 29, 38, 45, 51, 53, 54, 59, 68, 72, 73, 85, 86, 88, 92, 92, 95]), Vec::from([7, 9, 17, 23, 25, 26, 29, 32, 35, 56, 56, 58, 59, 59, 62, 63, 72, 82, 85, 86, 95, 97]), 15, 13, 
        3
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([-6, 48, -70, 14, -86, 56, 80, -64, 64, -88, -14, 78, 14, -18, 52, 2, 22, 88]), Vec::from([-62, -58, 60, -30, 42, 8, 66, -48, -18, 64, -76, -90, -48, -90, -24, 64, -88, -98]), 15, 9, 
        2
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1]), Vec::from([0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]), 10, 10, 
        9
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([10, 93, 2, 16, 36, 49, 36, 86, 6, 99, 95, 2]), Vec::from([99, 28, 7, 21, 62, 89, 82, 41, 43, 77, 8, 14]), 6, 10, 
        0
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-98, -96, -80, -64, -42, -30, -6, 10, 62, 66, 82]), Vec::from([-62, -50, -42, 24, 44, 46, 52, 54, 60, 72, 72]), 9, 6, 
        1
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([1, 1, 0, 1, 1]), Vec::from([1, 1, 1, 0, 0]), 4, 2, 
        4
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([7, 11, 13, 15, 21, 33, 36, 39, 66, 99]), Vec::from([23, 36, 42, 44, 62, 65, 70, 78, 82, 89]), 9, 9, 
        1
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([-40]), Vec::from([-98]), 0, 0, 
        0
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 1, 1, 1]), Vec::from([0, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]), 31, 26, 
        24
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([79, 91, 31, 16, 28, 45, 37, 43, 73, 73, 76, 28, 71, 60, 64, 60, 99, 36, 47, 38, 65, 34, 22, 94, 84, 51, 72, 45, 71, 2]), Vec::from([58, 94, 12, 27, 98, 38, 75, 20, 94, 43, 32, 90, 23, 41, 88, 2, 62, 96, 53, 57, 48, 79, 6, 16, 11, 46, 73, 57, 67, 7]), 18, 18, 
        1
      ));
      
  }
source_py: def remove_minimum_number_elements_no_common_element_exist_array(a, b, n, m):
      countA = dict()
      countB = dict()
      for i in range(n):
          countA[a[i]] = (countA.get(a[i], 0) + 1)
      for i in range(n):
          countB[b[i]] = (countB.get(b[i], 0) + 1)
      res = 0
      for x in countA:
          if (x in countB.keys()):
              res += min(countA[x], countB[x])
      return res
source_cpp: int remove_minimum_number_elements_no_common_element_exist_array(vector<int> a, vector<int> b, int n, int m) {
    unordered_map < int, int > countA, countB;
    for ( int i = 0;
    i < n;
    i ++ ) countA [ a [ i ] ] ++;
    for ( int i = 0;
    i < m;
    i ++ ) countB [ b [ i ] ] ++;
    int res = 0;
    for ( auto x : countA ) if ( countB . find ( x . first ) != countB . end ( ) ) res += min ( x . second, countB [ x . first ] );
    return res;
  }