Grokking the Coding Interview Patterns/

...

/

Solution: N-th Tribonacci Number

Solution: N-th Tribonacci Number

Let's solve the N-th Tribonacci Number problem using the Dynamic Programming pattern.

We'll cover the following...

Statement
Solution
- Naive approach
- Optimized approach using dynamic programming

Statement

Given a number n, calculate the corresponding Tribonacci number. The Tribonacci sequence $T_n$ is defined as:

$T_0 = 0,\space T_1 = 1,\space T_2 = 1$

...