[Java] Leetcode 718. Maximum Length of Repeated Subarray [DP Subsequence #9]

In this video, I'm going to show you how to solve Leetcode 718. Maximum Length of Repeated Subarray which is related to DP Subsequence.

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (1:08) Brute Force Approach
⌨️ (6:22) Difference between LCS and Maximum Length of Repeated Subarray
⌨️ (10:05) DP Solution
⌨️ (13:31) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 718. Maximum Length of Repeated Subarray and questions that are similar to this DP Subsequence.

Now, if you want to get good at DP Subsequence, please checkout my DP Subsequence playlist. [Category Link, this is where we put the category playlist link]

[AlexN]

in a sequence 3 - 2 - 1, we have calculated the longest subarray starting at "2". But we cannot simply reuse that for 3->2, since the location of the 2' match in the other array may be disconnected from the location of the 3's match.

[Kaafirpeado-ayesha]

How to come up with these ideas on my own 😮

[mdlwlmdddwd]

This is the definition of memorizing solution without knowing whats actually happening.