title: Number Digits Product Two Numbers
signature: def numberDigitsProductTwoNumbers(a: Int, b: 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(a: Int, b: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(a, b),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        86, 39, 
        4    
      )}")   
  
  
      println(s"TEST-1...${driver(
        81, 87, 
        4    
      )}")   
  
  
      println(s"TEST-2...${driver(
        48, 84, 
        4    
      )}")   
  
  
      println(s"TEST-3...${driver(
        64, 80, 
        4    
      )}")   
  
  
      println(s"TEST-4...${driver(
        56, 20, 
        4    
      )}")   
  
  
      println(s"TEST-5...${driver(
        5, 70, 
        3    
      )}")   
  
  
      println(s"TEST-6...${driver(
        25, 13, 
        3    
      )}")   
  
  
      println(s"TEST-7...${driver(
        94, 83, 
        4    
      )}")   
  
  
      println(s"TEST-8...${driver(
        5, 55, 
        3    
      )}")   
  
  
      println(s"TEST-9...${driver(
        46, 46, 
        4    
      )}")   
  
  }
  
source_py: def number_digits_product_two_numbers(a, b):
      count = 0
      p = abs((a * b))
      if (p == 0):
          return 1
      while (p > 0):
          count = (count + 1)
          p = (p // 10)
      return count
source_cpp: int number_digits_product_two_numbers(int a, int b) {
    int count = 0;
    int p = abs ( a * b );
    if ( p == 0 ) return 1;
    while ( p > 0 ) {
      count ++;
      p = p / 10;
    }
    return count;
  }