873. Length of Longest Fibonacci Subsequence

In a strictly increasing array, find the longest Fibonacci-like subsequence (each element from the third on equals the sum of the two before it), or 0 if none. The key structural fact: the last two…