Skip to content

Latest commit

 

History

History

maximum-length-of-repeated-subarray

Folders and files

NameName
Last commit message
Last commit date

parent directory

..

README.md

README.md

 
 

maximum_length_of_repeated_subarray.go

maximum_length_of_repeated_subarray.go

 
 

maximum_length_of_repeated_subarray_test.go

maximum_length_of_repeated_subarray_test.go

 
 

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

718. Maximum Length of Repeated Subarray (Medium)

Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.

Example 1:

Input:
A: [1,2,3,2,1]
B: [3,2,1,4,7]
Output: 3
Explanation: 
The repeated subarray with maximum length is [3, 2, 1].

 

Note:

  1. 1 <= len(A), len(B) <= 1000
  2. 0 <= A[i], B[i] < 100

 

Related Topics

[Array] [Hash Table] [Binary Search] [Dynamic Programming]

Similar Questions

  1. Minimum Size Subarray Sum (Medium)

Hints

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