title: Leonardo Number 1
signature: def leonardoNumber1(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Long , expected: Long): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Long): 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(
        75, 
        6832909245813413L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        76, 
        11055879401769513L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        55, 
        451702867433L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        14, 
        1219L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        43, 
        1402817465L    
      )}")   
  
  
      println(s"TEST-5...${driver(
        10, 
        177L    
      )}")   
  
  
      println(s"TEST-6...${driver(
        16, 
        3193L    
      )}")   
  
  
      println(s"TEST-7...${driver(
        30, 
        2692537L    
      )}")   
  
  
      println(s"TEST-8...${driver(
        44, 
        2269806339L    
      )}")   
  
  
      println(s"TEST-9...${driver(
        65, 
        55555780070575L    
      )}")   
  
  }
  
source_py: def leonardo_number_1(n):
      dp = []
      dp.append(1)
      dp.append(1)
      for i in range(2, (n + 1)):
          dp.append(((dp[(i - 1)] + dp[(i - 2)]) + 1))
      return dp[n]
source_cpp: int leonardo_number_1(int n) {
    int dp [ n + 1 ];
    dp [ 0 ] = dp [ 1 ] = 1;
    for ( int i = 2;
    i <= n;
    i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1;
    return dp [ n ];
  }