Skip to main content
/
Dynamic Programming
/
Fibonacci DP
1 / 20
Speed
EN
ES
0
1
0
0
0
0
0
0
0
0
0
0
1
2
3
4
5
6
7
8
9
10
Step 1:
Initial array: dp[0]=0, dp[1]=1. Fill remaining using dp[i] = dp[i-1] + dp[i-2].