title: Program To Find Remainder Without Using Modulo Or Operator 1
signature: def programToFindRemainderWithoutUsingModuloOrOperator1(num: Int, divisor: 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(num: Int, divisor: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(num, divisor),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        34, 55, 
        34    
      )}")   
  
  
      println(s"TEST-1...${driver(
        63, 22, 
        19    
      )}")   
  
  
      println(s"TEST-2...${driver(
        15, 26, 
        15    
      )}")   
  
  
      println(s"TEST-3...${driver(
        56, 58, 
        56    
      )}")   
  
  
      println(s"TEST-4...${driver(
        63, 94, 
        63    
      )}")   
  
  
      println(s"TEST-5...${driver(
        28, 45, 
        28    
      )}")   
  
  
      println(s"TEST-6...${driver(
        54, 97, 
        54    
      )}")   
  
  
      println(s"TEST-7...${driver(
        2, 58, 
        2    
      )}")   
  
  
      println(s"TEST-8...${driver(
        94, 91, 
        3    
      )}")   
  
  
      println(s"TEST-9...${driver(
        82, 40, 
        2    
      )}")   
  
  }
  
source_py: def program_to_find_remainder_without_using_modulo_or_operator_1(num, divisor):
      if (divisor == 0):
          return False
      if (divisor < 0):
          divisor = (- divisor)
      if (num < 0):
          num = (- num)
      i = 1
      product = 0
      while (product <= num):
          product = (divisor * i)
          i += 1
      return (num - (product - divisor))
source_cpp: int program_to_find_remainder_without_using_modulo_or_operator_1(int num, int divisor) {
    if ( divisor == 0 ) {
      return - 1;
    }
    if ( divisor < 0 ) divisor = - divisor;
    if ( num < 0 ) num = - num;
    int i = 1;
    int product = 0;
    while ( product <= num ) {
      product = divisor * i;
      i ++;
    }
    return num - ( product - divisor );
  }