problem718

README

< Previous 　　　　　　　　　　　　　　　　 Next >

718. Maximum Length of Repeated Subarray (Medium)

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
Explanation: 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

 

Constraints:

• 1 <= nums1.length, nums2.length <= 1000
• 0 <= nums1[i], nums2[i] <= 100

Related Topics

[Array] [Binary Search] [Dynamic Programming] [Sliding Window] [Rolling Hash] [Hash Function]

Similar Questions

1. Minimum Size Subarray Sum (Medium)
2. Longest Common Subpath (Hard)

Hints

Hint 1

Use dynamic programming. dp[i][j] will be the answer for inputs A[i:], B[j:].