Solving Maximum Length of Repeated Subarray in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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

See the full details of the problem Maximum Length of Repeated Subarray at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go