title: Find Largest Prime Factor Number
signature: findLargestPrimeFactorNumber(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          98, 
          7)
      }");
  
      print("TEST-1...${driver(
          8, 
          2)
      }");
  
      print("TEST-2...${driver(
          78, 
          13)
      }");
  
      print("TEST-3...${driver(
          65, 
          13)
      }");
  
      print("TEST-4...${driver(
          55, 
          11)
      }");
  
      print("TEST-5...${driver(
          10, 
          5)
      }");
  
      print("TEST-6...${driver(
          10, 
          5)
      }");
  
      print("TEST-7...${driver(
          37, 
          37)
      }");
  
      print("TEST-8...${driver(
          39, 
          13)
      }");
  
      print("TEST-9...${driver(
          15, 
          5)
      }");
  
      return 0;
  }
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;
  }