title: Largest Subsequence Gcd Greater 1
signature: def largestSubsequenceGcdGreater1(arr: List[Int], n: 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, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        List(10, 18, 22, 22, 22, 29, 30, 32, 33, 34, 37, 39, 40, 41, 44, 47, 49, 50, 50, 51, 53, 67, 69, 70, 71, 71, 73, 75, 78, 80, 81, 82, 91, 91, 93, 97, 97, 99), 35, 
        16    
      )}")   
  
  
      println(s"TEST-1...${driver(
        List(-42, 62, 6, 98, 38, -4, -38, 72, 42, 4, -22, -94, 78, -90, 14), 10, 
        10    
      )}")   
  
  
      println(s"TEST-2...${driver(
        List(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), 23, 
        0    
      )}")   
  
  
      println(s"TEST-3...${driver(
        List(89, 92, 96, 71, 24, 27, 18, 19, 41, 1, 45, 8), 7, 
        4    
      )}")   
  
  
      println(s"TEST-4...${driver(
        List(-98, -94, -92, -90, -82, -80, -76, -76, -72, -62, -60, -58, -56, -52, -42, -36, -32, -32, -24, -22, -20, -10, -10, -10, -8, -2, -2, 0, 2, 4, 6, 6, 8, 10, 14, 18, 22, 26, 30, 46, 46, 62, 68, 74, 78, 82, 86, 86), 40, 
        40    
      )}")   
  
  
      println(s"TEST-5...${driver(
        List(1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1), 41, 
        0    
      )}")   
  
  
      println(s"TEST-6...${driver(
        List(4, 8, 10, 10, 11, 17, 18, 25, 32, 33, 34, 37, 40, 41, 44, 47, 47, 52, 63, 77, 85, 87, 89, 89, 91, 95, 96, 98), 23, 
        10    
      )}")   
  
  
      println(s"TEST-7...${driver(
        List(-86, 52, -48, 70, 10, -94, 16, 14, 38, 62), 9, 
        9    
      )}")   
  
  
      println(s"TEST-8...${driver(
        List(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), 30, 
        0    
      )}")   
  
  
      println(s"TEST-9...${driver(
        List(95, 32, 87, 37, 86, 71, 30, 88, 96, 52, 88, 92, 79, 86, 19, 5, 74, 67), 13, 
        8    
      )}")   
  
  }
  
source_py: def largest_subsequence_gcd_greater_1(arr, n):
      ans = 0
      maxele = max(arr)
      for i in range(2, (maxele + 1)):
          count = 0
          for j in range(n):
              if ((arr[j] % i) == 0):
                  count += 1
          ans = max(ans, count)
      return ans
source_cpp: int largest_subsequence_gcd_greater_1(vector<int> arr, int n) {
    int ans = 0;
    int maxele = * max_element(arr.begin(), arr.end());
    for ( int i = 2;
    i <= maxele;
    ++ i ) {
      int count = 0;
      for ( int j = 0;
      j < n;
      ++ j ) {
        if ( arr [ j ] % i == 0 ) ++ count;
      }
      ans = max ( ans, count );
    }
    return ans;
  }