title: First Element Occurring K Times Array
signature: def firstElementOccurringKTimesArray(arr: List[Int], n: Int, k: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(arr: List[Int], n: Int, k: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n, k),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        List(2, 3, 4, 4, 7, 18, 20, 23, 27, 30, 31, 31, 32, 35, 36, 43, 45, 46, 49, 50, 53, 55, 59, 60, 64, 64, 65, 68, 78, 80, 80, 85, 95), 30, 2, 
        4    
      )}")   
  
  
      println(s"TEST-1...${driver(
        List(-26, 32, 36, 6, 64, 24, -28, 96), 6, 3, 
        -1    
      )}")   
  
  
      println(s"TEST-2...${driver(
        List(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), 15, 7, 
        -1    
      )}")   
  
  
      println(s"TEST-3...${driver(
        List(38, 40, 43, 70, 20, 40, 95, 96, 81, 82), 9, 1, 
        38    
      )}")   
  
  
      println(s"TEST-4...${driver(
        List(-68, -8, -8, 16, 24, 54), 3, 2, 
        -8    
      )}")   
  
  
      println(s"TEST-5...${driver(
        List(1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1), 6, 4, 
        0    
      )}")   
  
  
      println(s"TEST-6...${driver(
        List(13, 18, 19, 28, 31, 34, 49, 49, 53, 57, 58, 62, 75, 76, 77, 78, 80, 84, 84, 85, 87, 91, 98, 99), 20, 2, 
        49    
      )}")   
  
  
      println(s"TEST-7...${driver(
        List(-4, 24, -86, -84, 30, -16, 12, -92, -68, 22), 6, 5, 
        -1    
      )}")   
  
  
      println(s"TEST-8...${driver(
        List(0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1), 8, 10, 
        -1    
      )}")   
  
  
      println(s"TEST-9...${driver(
        List(55, 44, 75, 97, 25, 65, 76, 53, 20, 78, 25, 59, 61, 29, 81, 35, 15, 78, 41, 44, 31, 33, 39, 93, 26, 67), 23, 20, 
        -1    
      )}")   
  
  }
  
source_py: def first_element_occurring_k_times_array(arr, n, k):
      count_map = {
          
      }
      for i in range(0, n):
          if (arr[i] in count_map.keys()):
              count_map[arr[i]] += 1
          else:
              count_map[arr[i]] = 1
          i += 1
      for i in range(0, n):
          if (count_map[arr[i]] == k):
              return arr[i]
          i += 1
      return (- 1)
source_cpp: int first_element_occurring_k_times_array(vector<int> arr, int n, int k) {
    unordered_map < int, int > count_map;
    for ( int i = 0;
    i < n;
    i ++ ) count_map [ arr [ i ] ] ++;
    for ( int i = 0;
    i < n;
    i ++ ) if ( count_map [ arr [ i ] ] == k ) return arr [ i ];
    return - 1;
  }