You are given two $0$ indexed binary arrays nums1 and nums2, both of length n.

A pair of indices (i, j) is considered valid if $0 \leq i \leq j < n$ and the sum of the elements from index i to index j inclusive in nums1 is equal to the sum of the elements from index i to index j inclusive in nums2.

The distance between the pair of indices (i, j) is defined as $j - i + 1$.

Return the maximum distance of a valid pair of indices (i, j). If there are no valid pairs of indices, return $0$.

Constraints:

• n $==$ nums1.length $==$ nums2.length

• $1 \leq$ n $\leq 10^5$

• nums1[i] is either $0$ or $1$.

• nums2[i] is either $0$ or $1$.

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.