1236. N-th Tribonacci Number

Easy
Math
Dynamic Programming
Memoization

Description

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 <= 37
  • The answer is guaranteed to fit within a 32-bit integer, ie. answer <= 2^31 - 1.

Hints

Hint 1
Make an array F of length 38, and set F[0] = 0, F[1] = F[2] = 1.
Hint 2
Now write a loop where you set F[n+3] = F[n] + F[n+1] + F[n+2], and return F[n].

Statistics

Acceptance
63.3%
Submissions
1,643,534
Accepted
1,041,026