LeetCode Question

#1137 N-th Tribonacci Number

SWE coding Easy

Sign in to bookmark Original →

Question Details

LeetCode #1137: N-th Tribonacci Number. Difficulty: Easy. Topics: Math, Dynamic Programming, Memoization. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Memoization Dynamic Programming Math

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Dynamic Programming Questions →