Skip to content

problem1.md

Latest commit

 

History

History
15 lines (12 loc) · 493 Bytes

problem1.md

File metadata and controls

15 lines (12 loc) · 493 Bytes

Problem 1: Golden Ratio Sequence (Fibonacci Number)

Problem Statement

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

  • F(0) = 0, F(1) = 1
  • F(n) = F(n - 1) + F(n - 2), for n > 1. Given n, calculate F(n).

Input Format

  • An integer n.

Example

Input: n = 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.