[Java] Leetcode 53. Maximum Subarray [DP Subsequence #3]

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

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

Course Contents
(0:00​) Question Walkthrough
(2:00) Solution Explain
(6:04) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 53. Maximum 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.

[Rob-J-BJJ]

I had to review this one, I keep thinking its a sliding window problem

[inchworm]

Thanks!
Still working on sharpening my dynamic programming skills

[parenthecoltsenr]

I wonder why this problem is now considered medium on leetcode's website 🤔

[khalidmahmoud]

Great explanation thank you.
I think curMaxSum should be = 0 not nums[0]?