Skip to main content

Fibonacci (DP)

Learn Fibonacci (DP) (Dynamic Programming, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Recursion A recursive function calls itself with a smaller version of the problem until it reaches a base case that can be answered directly without further recursion. Every recursive function needs both a base case (to stop) and a recursive case (to progress toward it).

More lessons in Dynamic Programming