Maximum Length of Repeated Subarray

arraybinary searchdynamic programming

Given two integer arrays nums1 and nums2 , return the maximum length of a subarray that appears in both arrays .

Example 1

Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
Output: 3
The repeated subarray with maximum length is [3,2,1].

Example 2

Input: nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
Output: 5
The repeated subarray with maximum length is [0,0,0,0,0].

1 <= nums1.length, nums2.length <= 1000

0 <= nums1[i], nums2[i] <= 100

🤔

Medium

Difficulty

Topic Info

ModuleDSA

CategoryArray

Sub-topicBinary Search