3708. Longest Fibonacci Subarray

LeetCodeArrayOpen on judge ↗

You are given an array of positive integers nums. A Fibonacci array is a contiguous sequence whose third and subsequent terms each equal the sum of the two preceding terms. Return the length of the longest Fibonacci subarray in nums. Note: Subarrays of length 1 or 2 are always Fibonacci. Example 1: Input: nums = [1,1,1,1,2,3,5,1] Output: 5 Explanation: The longest Fibonacci subarray is n

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI