Fundamentals/What is Dynamic Programming?
← PrevNext →
Given a non-negative integer n, return the nth Fibonacci number using bottom-up DP (fib(0) = 0, fib(1) = 1).