Recursion: Fibonacci Numbers HackerRank Solution

Recursion: Fibonacci Numbers HackerRank Solution
Source : https://www.hackerrank.com/challenges/ctci-fibonacci-numbers

The Fibonacci Sequence

The Fibonacci sequence appears in nature all around us, in the arrangement of seeds in a sunflower and the spiral of a nautilus for example.

The Fibonacci sequence begins with and as its first and second terms. After these first two elements, each subsequent element is equal to the sum of the previous two elements.

Programmatically:

Given , return the number in the sequence.

As an example, . The Fibonacci sequence to is . With zero-based indexing, .

Function Description

Complete the recursive function in the editor below. It must return the element in the Fibonacci sequence.

fibonacci has the following parameter(s):

• n: the integer index of the sequence to return

Input Format

The input line contains a single integer, .

Constraints

Output Format

Locked stub code in the editor prints the integer value returned by the function.

Sample Input

3  

Sample Output

2

Explanation

The Fibonacci sequence begins as follows:

...

We want to know the value of . In the sequence above, evaluates to .

Source : https://www.hackerrank.com/challenges/ctci-fibonacci-numbers

Solution

	// Karthikalapati.blogspot.com
	import java.util.Scanner;
	// Time Complexity: O(n)
	// Space Complexity: O(1)
	public class Solution {
	public static void main(String[] args) {
	Scanner scan = new Scanner(System.in);
	int n = scan.nextInt();
	scan.close();
	System.out.println(fibonacci(n));
	}
	private static int fibonacci(int n) {
	int prev = 0;
	int curr = 1;
	for (int i = 2; i <= n; i++) {
	int next = prev + curr;
	prev = curr;
	curr = next;
	}
	return curr;
	}
	}