Given an integer array nums, find the length of the longest contiguous subarray such that no element in the subarray is equal to the sum of two other elements at distinct indices within that subarray.

More formally, a subarray is valid if there are no three pairwise distinct indices $i$, $j$, and $k$ within the subarray such that subarray[i] + subarray[j] = subarray[k].

Return the maximum length of a valid subarray.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 500$

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.