title: Number Digits Product Two Numbers 1
signature: def numberDigitsProductTwoNumbers1(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(
        97, 91, 
        4    
      )}")   
  
  
      println(s"TEST-1...${driver(
        52, 49, 
        4    
      )}")   
  
  
      println(s"TEST-2...${driver(
        95, 34, 
        4    
      )}")   
  
  
      println(s"TEST-3...${driver(
        35, 40, 
        4    
      )}")   
  
  
      println(s"TEST-4...${driver(
        40, 85, 
        4    
      )}")   
  
  
      println(s"TEST-5...${driver(
        18, 97, 
        4    
      )}")   
  
  
      println(s"TEST-6...${driver(
        92, 15, 
        4    
      )}")   
  
  
      println(s"TEST-7...${driver(
        73, 98, 
        4    
      )}")   
  
  
      println(s"TEST-8...${driver(
        10, 62, 
        3    
      )}")   
  
  
      println(s"TEST-9...${driver(
        82, 22, 
        4    
      )}")   
  
  }
  
source_py: def number_digits_product_two_numbers_1(a, b):
      if ((a == 0) or (b == 0)):
          return 1
      return (math.floor((math.log10(abs(a)) + math.log10(abs(b)))) + 1)
source_cpp: int number_digits_product_two_numbers_1(int a, int b) {
    if ( a == 0 || b == 0 ) return 1;
    return floor ( log10 ( abs ( a ) ) + log10 ( abs ( b ) ) ) + 1;
  }