bugl
bugl
HomeLearnPatternsPathsSearchPremium
HomeLearnPatternsPaths
Easy1-D Dynamic ProgrammingLC 509

Fibonacci Number

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).

Asked at 8 companies
AmazonAppleBarclays
Hints
  • 1.Think about which data structure fits best
  • 2.Consider the time complexity of your approach
  • 3.Look for patterns in the constraints
LeetCode