Dynamic Programming/Fibonacci
memoizationtabulationoverlapping-subproblems
Press play to start
1int fibonacci(int n) {
2 int dp[n + 1];
3 dp[0] = 0; dp[1] = 1;
4 for (int i = 2; i <= n; i++) {
5 dp[i] = dp[i - 1] + dp[i - 2];
6 }
7 return dp[n];
8}
Step 1/0

Practice

LeetCode·#509 Fibonacci NumberEasyHackerRank·Fibonacci NumbersEasyNeetCode·Climbing StairsEasy
BestO(n)
AverageO(n)
WorstO(n)
SpaceO(n)