title: Program To Find Remainder Without Using Modulo Or Operator 2
signature: programToFindRemainderWithoutUsingModuloOrOperator2(num, divisor) {
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(num, divisor, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(num, divisor), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          70, 13, 
          5)
      }");
  
      print("TEST-1...${driver(
          77, 3, 
          2)
      }");
  
      print("TEST-2...${driver(
          77, 73, 
          4)
      }");
  
      print("TEST-3...${driver(
          88, 54, 
          34)
      }");
  
      print("TEST-4...${driver(
          96, 39, 
          18)
      }");
  
      print("TEST-5...${driver(
          6, 10, 
          6)
      }");
  
      print("TEST-6...${driver(
          79, 95, 
          79)
      }");
  
      print("TEST-7...${driver(
          44, 32, 
          12)
      }");
  
      print("TEST-8...${driver(
          26, 86, 
          26)
      }");
  
      print("TEST-9...${driver(
          82, 91, 
          82)
      }");
  
      return 0;
  }
source_py: def program_to_find_remainder_without_using_modulo_or_operator_2(num, divisor):
      while (num >= divisor):
          num -= divisor
      return num
source_cpp: int program_to_find_remainder_without_using_modulo_or_operator_2(int num, int divisor) {
    while ( num >= divisor ) num -= divisor;
    return num;
  }