You are given two integer arrays nums1 and nums2 of equal length.

In a single right shift operation, the last element of nums1 moves to index $0$, and every other element moves $1$ position to the right.

Return the maximum number of indices i such that nums1[i] == nums2[i] after performing any number of right shifts on nums1.

Constraints:

• nums1.length $==$ nums2.length

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

• $1 \leq$ nums1[i], nums2[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.