Search⌘ K
AI Features
Home
Courses
A Complete Guide to Java Programming

Challenge: Compute Sum of N Fibonacci Numbers

Explore how to write a function in Java that computes the sum of the first N Fibonacci numbers. This lesson helps you understand the Fibonacci sequence concept and apply algorithmic thinking to solve programming challenges.

We'll cover the following...

Problem statement

In Mathematics, the Fibonacci sequence or series is defined as a series of numbers in which each number is the sum of the two preceding numbers. The simplest is the series 1,1,2,3,5,81, 1, 2, 3, 5, 8, etc.

  • In the given findTheSum function, the number n is passed as an argument where n represents the number of Fibonacci numbers starting from 1 that we want to compute the sum of.

Expected output

The sum of the first five Fibonacci numbers is 12.

Java
class SumOfFirstFibonacciNumbers {
    public static int findTheSum(int n) {
        
        // Write your code here
        
        return 0;
    }
}