Skip to content

problem2.md

Latest commit

 

History

History
14 lines (10 loc) · 341 Bytes

problem2.md

File metadata and controls

14 lines (10 loc) · 341 Bytes

Problem 2: The Golden Sequence Optimized (Fibonacci with DP)

Problem Statement

Compute the N-th Fibonacci number efficiently using Dynamic Programming (bottom-up tabulation). F(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2).

Input Format

  • An integer n.

Constraints

  • 0 <= n <= 100

Example

Input: n = 10
Output: 55