title: Sum Fibonacci Numbers
signature: function sum_fibonacci_numbers(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(9, 88);
      @printf("TEST-0...%s\n",result);
      
      result = driver(50, 32951280098);
      @printf("TEST-1...%s\n",result);
      
      result = driver(7, 33);
      @printf("TEST-2...%s\n",result);
      
      result = driver(21, 28656);
      @printf("TEST-3...%s\n",result);
      
      result = driver(21, 28656);
      @printf("TEST-4...%s\n",result);
      
      result = driver(11, 232);
      @printf("TEST-5...%s\n",result);
      
      result = driver(25, 196417);
      @printf("TEST-6...%s\n",result);
      
      result = driver(62, 10610209857722);
      @printf("TEST-7...%s\n",result);
      
      result = driver(4, 7);
      @printf("TEST-8...%s\n",result);
      
  end
  
  main()
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;
  }