Given an array of positive integers nums, find the length of the longest Fibonacci subarray.

A subarray of nums is called a Fibonacci subarray if:

• Its length is at least $2$.

• Every element from the third element onward is equal to the sum of the preceding two elements.

Return the length of the longest Fibonacci subarray in nums.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

• $3 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.