title: Fibonacci Modulo P
signature: def fibonacciModuloP(p: 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(p: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(p),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        51, 
        36    
      )}")   
  
  
      println(s"TEST-1...${driver(
        40, 
        30    
      )}")   
  
  
      println(s"TEST-2...${driver(
        68, 
        18    
      )}")   
  
  
      println(s"TEST-3...${driver(
        7, 
        8    
      )}")   
  
  
      println(s"TEST-4...${driver(
        8, 
        6    
      )}")   
  
  
      println(s"TEST-5...${driver(
        32, 
        24    
      )}")   
  
  
      println(s"TEST-6...${driver(
        93, 
        60    
      )}")   
  
  
      println(s"TEST-7...${driver(
        75, 
        100    
      )}")   
  
  
      println(s"TEST-8...${driver(
        71, 
        70    
      )}")   
  
  
      println(s"TEST-9...${driver(
        15, 
        20    
      )}")   
  
  }
  
source_py: def fibonacci_modulo_p(p):
      first = 1
      second = 1
      number = 2
      next = 1
      while next:
          next = ((first + second) % p)
          first = second
          second = next
          number = (number + 1)
      return number
source_cpp: int fibonacci_modulo_p(int p) {
    int first = 1, second = 1, number = 2, next = 1;
    while ( next ) {
      next = ( first + second ) % p;
      first = second;
      second = next;
      number ++;
    }
    return number;
  }