title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: def zeckendorfsTheoremNonNeighbouringFibonacciRepresentation(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(
        54, 
        34    
      )}")   
  
  
      println(s"TEST-1...${driver(
        71, 
        55    
      )}")   
  
  
      println(s"TEST-2...${driver(
        64, 
        55    
      )}")   
  
  
      println(s"TEST-3...${driver(
        71, 
        55    
      )}")   
  
  
      println(s"TEST-4...${driver(
        96, 
        89    
      )}")   
  
  
      println(s"TEST-5...${driver(
        43, 
        34    
      )}")   
  
  
      println(s"TEST-6...${driver(
        70, 
        55    
      )}")   
  
  
      println(s"TEST-7...${driver(
        94, 
        89    
      )}")   
  
  
      println(s"TEST-8...${driver(
        95, 
        89    
      )}")   
  
  
      println(s"TEST-9...${driver(
        69, 
        55    
      )}")   
  
  }
  
source_py: def zeckendorfs_theorem_non_neighbouring_fibonacci_representation(n):
      if ((n == 0) or (n == 1)):
          return n
      (f1, f2, f3) = (0, 1, 1)
      while (f3 <= n):
          f1 = f2
          f2 = f3
          f3 = (f1 + f2)
      return f2
source_cpp: int zeckendorfs_theorem_non_neighbouring_fibonacci_representation(int n) {
    if ( n == 0 || n == 1 ) return n;
    int f1 = 0, f2 = 1, f3 = 1;
    while ( f3 <= n ) {
      f1 = f2;
      f2 = f3;
      f3 = f1 + f2;
    }
    return f2;
  }