Watch 10 video solutions for N-th Tribonacci Number, a easy level problem involving Math, Dynamic Programming, Memoization. This walkthrough by NeetCodeIO has 10,701 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
The Tribonacci sequence Tn is defined as follows:
T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.
Given n, return the value of Tn.
Example 1:
Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4
Example 2:
Input: n = 25 Output: 1389537
Constraints:
0 <= n <= 37answer <= 2^31 - 1.