title: Find Largest Prime Factor Number
signature: def findLargestPrimeFactorNumber(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(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        98, 
        7    
      )}")   
  
  
      println(s"TEST-1...${driver(
        8, 
        2    
      )}")   
  
  
      println(s"TEST-2...${driver(
        78, 
        13    
      )}")   
  
  
      println(s"TEST-3...${driver(
        65, 
        13    
      )}")   
  
  
      println(s"TEST-4...${driver(
        55, 
        11    
      )}")   
  
  
      println(s"TEST-5...${driver(
        10, 
        5    
      )}")   
  
  
      println(s"TEST-6...${driver(
        10, 
        5    
      )}")   
  
  
      println(s"TEST-7...${driver(
        37, 
        37    
      )}")   
  
  
      println(s"TEST-8...${driver(
        39, 
        13    
      )}")   
  
  
      println(s"TEST-9...${driver(
        15, 
        5    
      )}")   
  
  }
  
source_py: def find_largest_prime_factor_number(n):
      maxPrime = (- 1)
      while ((n % 2) == 0):
          maxPrime = 2
          n >>= 1
      for i in range(3, (int(math.sqrt(n)) + 1), 2):
          while ((n % i) == 0):
              maxPrime = i
              n = (n / i)
      if (n > 2):
          maxPrime = n
      return int(maxPrime)
source_cpp: long long find_largest_prime_factor_number(long long n) {
    long long maxPrime = - 1;
    while ( n % 2 == 0 ) {
      maxPrime = 2;
      n >>= 1;
    }
    for ( int i = 3;
    i <= sqrt ( n );
    i += 2 ) {
      while ( n % i == 0 ) {
        maxPrime = i;
        n = n / i;
      }
    }
    if ( n > 2 ) maxPrime = n;
    return maxPrime;
  }