1137. N-th Tribonacci Number

Author: ioesandeep

leetcode/easy/NthTribonacciNumber.java

@@ -0,0 +1,24 @@
+package leetcode.easy;
+
+public class NthTribonacciNumber {
+    public int tribonacci(int n) {
+        if (n == 0) {
+            return 0;
+        }
+        if (n <= 2) {
+            return 1;
+        }
+
+        int[] cache = new int[n + 1];
+
+        cache[0] = 0;
+        cache[1] = 1;
+        cache[2] = 1;
+
+        for (int i = 3; i <= n; i++) {
+            cache[i] = cache[i - 1] + cache[i - 2] + cache[i - 3];
+        }
+
+        return cache[n];
+    }
+}

readme.md

@@ -162,7 +162,7 @@ EASY
 |[1119. Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/easy/RemoveVowelsFromString.java)|
 |[1123. Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/medium/LCADeepestLeaves.java)|
 |[1134. Armstrong Number](https://leetcode.com/problems/armstrong-number/)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/easy/ArmstrongNumber.java)|
-|[]()|[java]()|
+|[1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[java](https://github.com/wdydev/leetcode/blob/master/leetcode/easy/NthTribonacciNumber.java)|
 |[]()|[java]()|
 |[]()|[java]()|
 |[]()|[java]()|