title: Nth Non Fibonacci Number
signature: def nthNonFibonacciNumber(n: 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(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        76, 
        85    
      )}")   
  
  
      println(s"TEST-1...${driver(
        91, 
        101    
      )}")   
  
  
      println(s"TEST-2...${driver(
        62, 
        71    
      )}")   
  
  
      println(s"TEST-3...${driver(
        65, 
        74    
      )}")   
  
  
      println(s"TEST-4...${driver(
        83, 
        93    
      )}")   
  
  
      println(s"TEST-5...${driver(
        57, 
        66    
      )}")   
  
  
      println(s"TEST-6...${driver(
        76, 
        85    
      )}")   
  
  
      println(s"TEST-7...${driver(
        6, 
        11    
      )}")   
  
  
      println(s"TEST-8...${driver(
        2, 
        6    
      )}")   
  
  
      println(s"TEST-9...${driver(
        86, 
        96    
      )}")   
  
  }
  
source_py: def nth_non_fibonacci_number(n):
      prevPrev = 1
      prev = 2
      curr = 3
      while (n > 0):
          prevPrev = prev
          prev = curr
          curr = (prevPrev + prev)
          n = (n - ((curr - prev) - 1))
      n = (n + ((curr - prev) - 1))
      return (prev + n)
source_cpp: int nth_non_fibonacci_number(int n) {
    int prevPrev = 1, prev = 2, curr = 3;
    while ( n > 0 ) {
      prevPrev = prev;
      prev = curr;
      curr = prevPrev + prev;
      n = n - ( curr - prev - 1 );
    }
    n = n + ( curr - prev - 1 );
    return prev + n;
  }