Given two integer arrays nums1 and nums2, return the maximum length of a subarray that appears in both arrays.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 1000$

• $0 \leq$ nums1[i], nums2[i] $\leq 100$

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.