title: Sum Fibonacci Numbers
signature: sumFibonacciNumbers(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          9, 
          88)
      }");
  
      print("TEST-1...${driver(
          50, 
          32951280098)
      }");
  
      print("TEST-2...${driver(
          7, 
          33)
      }");
  
      print("TEST-3...${driver(
          21, 
          28656)
      }");
  
      print("TEST-4...${driver(
          21, 
          28656)
      }");
  
      print("TEST-5...${driver(
          11, 
          232)
      }");
  
      print("TEST-6...${driver(
          25, 
          196417)
      }");
  
      print("TEST-7...${driver(
          62, 
          10610209857722)
      }");
  
      print("TEST-8...${driver(
          4, 
          7)
      }");
  
      return 0;
  }
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;
  }