Feb 27

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Length of Longest Fibonacci Subsequence.py

@@ -0,0 +1,25 @@
+class Solution:
+    def lenLongestFibSubseq(self, arr: list[int]) -> int:
+        nums = set(arr)
+        max_len = 0
+        for i in range(len(arr)):
+            for j in range(i+1, len(arr)):
+                n1, n2 = arr[i], arr[j]
+                length = 0
+                while n1 + n2 in nums:
+                    n1, n2 = n2, n1 + n2
+                    length += 1
+                max_len = max(max_len, length)
+        return max_len + 2 if max_len > 0 else max_len
+
+
+def main():
+    arr = [1, 2, 3, 4, 5, 6, 7, 8]
+    assert Solution().lenLongestFibSubseq(arr) == 5
+
+    arr = [1, 3, 7, 11, 12, 14, 18]
+    assert Solution().lenLongestFibSubseq(arr) == 3
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -30,13 +30,13 @@
 | February 24 | [2467. Most Profitable Path in a Tree](https://leetcode.com/problems/most-profitable-path-in-a-tree/) | Medium | Unsolved |
 | February 25 | [1524. Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/) | Medium | Solved |
 | February 26 | [1749. Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | Medium | Unsolved |
-| February 27 | []() |  |  |
+| February 27 | [873. Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/) | Medium | Solved |
 | February 28 | []() |  |  |
 
 
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 18 | 13 | 5 |
+| Medium | 19 | 14 | 5 |
 | Hard   | 1 | 1 | 0 |