title: Sum Fibonacci Numbers
signature: def sumFibonacciNumbers(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(
        9, 
        88L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        50, 
        32951280098L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        7, 
        33L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        21, 
        28656L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        21, 
        28656L    
      )}")   
  
  
      println(s"TEST-5...${driver(
        11, 
        232L    
      )}")   
  
  
      println(s"TEST-6...${driver(
        25, 
        196417L    
      )}")   
  
  
      println(s"TEST-7...${driver(
        62, 
        10610209857722L    
      )}")   
  
  
      println(s"TEST-8...${driver(
        4, 
        7L    
      )}")   
  
  }
  
source_py: def sum_fibonacci_numbers(n):
      if (n <= 0):
          return 0
      fibo = ([0] * (n + 1))
      fibo[1] = 1
      sm = (fibo[0] + fibo[1])
      for i in range(2, (n + 1)):
          fibo[i] = (fibo[(i - 1)] + fibo[(i - 2)])
          sm = (sm + fibo[i])
      return sm
source_cpp: int sum_fibonacci_numbers(int n) {
    if ( n <= 0 ) return 0;
    int fibo [ n + 1 ];
    fibo [ 0 ] = 0, fibo [ 1 ] = 1;
    int sum = fibo [ 0 ] + fibo [ 1 ];
    for ( int i = 2;
    i <= n;
    i ++ ) {
      fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ];
      sum += fibo [ i ];
    }
    return sum;
  }