**Difficulty**: Medium**Tags**: LeetCode, Medium, Array, Hash Table, Prefix Sum, leetcode-1983, O(n)

# Problem

You are given two **0-indexed** binary arrays `nums1`

and `nums2`

. Find the **widest** pair of indices `(i, j)`

such that `i <= j`

and `nums1[i] + nums1[i+1] + ... + nums1[j] == nums2[i] + nums2[i+1] + ... + nums2[j]`

.

The **widest** pair of indices is the pair with the **largest** **distance** between `i`

and `j`

. The **distance** between a pair of indices is defined as `j - i + 1`

.

Return *the distance of the widest pair of indices. If no pair of indices meets the conditions, return *

`0`

.

**Example 1:**

Input:nums1 = [1,1,0,1], nums2 = [0,1,1,0]Output:3Explanation:If i = 1 and j = 3: nums1[1] + nums1[2] + nums1[3] = 1 + 0 + 1 = 2. nums2[1] + nums2[2] + nums2[3] = 1 + 1 + 0 = 2. The distance between i and j is j - i + 1 = 3 - 1 + 1 = 3.

**Example 2:**

Input:nums1 = [0,1], nums2 = [1,1]Output:1Explanation:If i = 1 and j = 1: nums1[1] = 1. nums2[1] = 1. The distance between i and j is j - i + 1 = 1 - 1 + 1 = 1.

**Example 3:**

Input:nums1 = [0], nums2 = [1]Output:0Explanation:There are no pairs of indices that meet the requirements.

**Constraints:**

`n == nums1.length == nums2.length`

`1 <= n <= 10`

^{5}`nums1[i]`

is either`0`

or`1`

.`nums2[i]`

is either`0`

or`1`

.