Find length of the longest Fibonacci subsequence

The objective of this article is to discuss various approaches to solve the length of the longest Fibonacci subsequence problem. In this problem, we have a strictly increasing array of positive integers. Our task is to find the length of the longest Fibonacci subsequence possible. We will solve this using Brute force and Dynamic Programming.

For example:

Input: arr = [1,2,3,4,5,6,7,8]Output: 5Explanation: The longest fibonacci subsequence is [1,2,3,5,8].Input: arr = [1,3,7,11,12,14,18]Outpu...