Apr 24

Author: siddydutta

2024-04-April-LeetCoding-Challenge/N-th Tribonacci Number.py

@@ -0,0 +1,21 @@
+class Solution:
+    def tribonacci(self, n: int) -> int:
+        if n <= 2:
+            return 1 if n else 0
+
+        p1, p2, p3 = 0, 1, 1
+        for _ in range(n-2):
+            p1, p2, p3 = p2, p3, p1+p2+p3
+        return p3
+
+
+def main():
+    n = 4
+    assert Solution().tribonacci(n) == 4
+
+    n = 25
+    assert Solution().tribonacci(n) == 1389537
+
+
+if __name__ == '__main__':
+    main()

2024-04-April-LeetCoding-Challenge/README.md

@@ -26,7 +26,7 @@
 | April 21 | []() |  |  |
 | April 22 | [752. Open the Lock](https://leetcode.com/problems/open-the-lock/) | Medium | Unsolved |
 | April 23 | [310. Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | Medium | Unsolved |
-| April 24 | []() |  |  |
+| April 24 | [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Easy | Solved |
 | April 25 | []() |  |  |
 | April 26 | []() |  |  |
 | April 27 | []() |  |  |
@@ -38,6 +38,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 8 | 8 | 0 |
+| Easy   | 9 | 9 | 0 |
 | Medium | 11 | 6 | 5 |
 | Hard   | 0 | 0 | 0 |