<p>Given two integer arrays <code>nums1</code> and <code>nums2</code>, return <em>the maximum length of a subarray that appears in <strong>both</strong> arrays</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The repeated subarray with maximum length is [3,2,1].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
<strong>Output:</strong> 5
<strong>Explanation:</strong> The repeated subarray with maximum length is [0,0,0,0,0].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 100</code></li>
</ul>

class Solution:
    def findLength(self, nums1: List[int], nums2: List[int]) -> int:
        max_common_prefix_length = 0

        def custom_comparator(tuple1, tuple2):
            nonlocal max_common_prefix_length
            subarr1, array_num1 = tuple1
            subarr2, array_num2 = tuple2
            if array_num1 == array_num2:
                return (subarr1 > subarr2) - (subarr1 < subarr2)

            common_length = 0
            min_len = min(len(subarr1), len(subarr2))
            for i in range(min_len):
                if subarr1[i] == subarr2[i]:
                    common_length += 1
                else:
                    break

            if common_length > max_common_prefix_length:
                max_common_prefix_length = common_length

            if common_length == min_len: 
                return len(subarr1) - len(subarr2)

            return (subarr1[common_length:] > subarr2[common_length:]) - (subarr1[common_length:] < subarr2[common_length:])


        p = [(nums1[i:], 1) for i in range(len(nums1))] + [(nums2[i:], 2)
                                                           for i in range(len(nums2))]
        p.sort(key=cmp_to_key(custom_comparator))

        return max_common_prefix_length
24700