LeetCode 689. Maximum Sum of 3 Non-Overlapping Subarrays Explanation and Solution

Thanks in advance. :D

Happy coding every day!

[TheNayanava]

I actually follow almost all your solutions and even if I don't understand something when you are speaking, I definitely get it when you are writing the code!! Keep up the amazing work!! :)

[Paunitza]

I've seen this problem explained several times. Your explanation was the best. Keep up the good work!

[akshatgupta]

Had no clue of the solution before watching your video, then you did a wonderful work :)

[maximebellevue]

Thank you!
I had this eureka moment when I understood the phase where you use left and right arrays to accumulate the maxIndex towards the center which allows during the last step to use the dp array as the middle subarray and when iterating through it fetch maxLeft (i-k) maxRight (i+k).
Your explanation and notes are great.

[ashishdey]

Brilliant. Amazingly explained. Loved it. Keep posting such amazing stuffs. Thanks for the help.

[baurks]

Thanks so much for this video. I have a question, how can this solution be extended to M subarrays?

[enigmasidd]

I had to watch this twice but this is a hard question to understand and code correctly. Great work explaining this!

[shubamsharma]

Thanks for explanation even it was difficult to understand your english i understood the concept easily.
Thanks for all your hardwork keep up the amazing work.

[suhasnayak]

If you could have explained the intuition behind this or how you came up with this solution that would have helped! Anyway thanks.

[nagalakshmi]

real hard problem, I have to watch video 5 times to get the solution