You are given two $0$ indexed integer arrays, nums1 and nums2, both sorted in nonincreasing order.

A pair of indices (i, j) is considered valid if $0 \leq$ i $<$ nums1.length, $0 \leq$ j $<$ nums2.length, i $\leq$ j, and nums1[i] $\leq$ nums2[j]. The distance of this pair is j $-$ i.

Return the maximum distance of any valid pair (i, j). If no valid pairs exist, return $0$.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 10^5$

• $1 \leq$ nums1[i], nums2[j] $\leq 10^5$

• Both nums1 and nums2 are sorted in nonincreasing order.

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.