Length of Longest Fibonacci Subsequence (LeetCode 873)
MediumLeetCode 873 · 1D · Google, Amazon +5 · 48:26Length of Longest Fibonacci Subsequence · Recursion Memo · Bottom Up · Leetcode 873My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 873 Length of Longest Fibonacci Subsequence by codestorywithMIK: Dynamic Programming, Medium. Topics: Array, Hash Table, Dynamic Programming. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Hash Table, Dynamic Programming
- Patterns
- 1D, Subsequences/Strings (LCS, Edit Distance)
- Chapter
- Dynamic Programming
- Duration
- 48:26
Related problems
- Fibonacci Number (LeetCode 509)
- Climbing Stairs (LeetCode 70)
- House Robber (LeetCode 198)
- House Robber II (LeetCode 213)
- Maximum Alternating Subsequence Sum (LeetCode 1911)
- Longest Increasing Subsequence (LeetCode 300)
- Build Array Where You Can Find The Maximum Exactly K Comparisons (LeetCode 1420)
- Maximum Balanced Subsequence Sum (LeetCode 2926)