bugl
bugl
HomeLearnPatternsPathsSearchPremium
HomeLearnPatternsPaths
Easy1-D Dynamic ProgrammingLC 1137

N-th Tribonacci Number

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.

Asked at 2 companies
CourseraFacebook
Hints
  • 1.Think about which data structure fits best
  • 2.Consider the time complexity of your approach
  • 3.Look for patterns in the constraints
LeetCode