title: Count Trailing Zeroes Factorial Number
signature: def countTrailingZeroesFactorialNumber(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(
        9, 
        1    
      )}")   
  
  
      println(s"TEST-1...${driver(
        43, 
        9    
      )}")   
  
  
      println(s"TEST-2...${driver(
        50, 
        12    
      )}")   
  
  
      println(s"TEST-3...${driver(
        32, 
        7    
      )}")   
  
  
      println(s"TEST-4...${driver(
        37, 
        8    
      )}")   
  
  
      println(s"TEST-5...${driver(
        51, 
        12    
      )}")   
  
  
      println(s"TEST-6...${driver(
        33, 
        7    
      )}")   
  
  
      println(s"TEST-7...${driver(
        49, 
        10    
      )}")   
  
  
      println(s"TEST-8...${driver(
        1, 
        0    
      )}")   
  
  
      println(s"TEST-9...${driver(
        75, 
        18    
      )}")   
  
  }
  
source_py: def count_trailing_zeroes_factorial_number(n):
      count = 0
      i = 5
      while ((n / i) >= 1):
          count += int((n / i))
          i *= 5
      return int(count)
source_cpp: int count_trailing_zeroes_factorial_number(int n) {
    int count = 0;
    for ( int i = 5;
    n / i >= 1;
    i *= 5 ) count += n / i;
    return count;
  }