Maximum Sum of 3 Non Overlapping Subarrays | Leetcode 689

[@dhruvdangi8923]

awesome solution sir

[@techdose4u]

thanks

[@thecolossalquasar5722]

Sir, why is the runtime so much low for your solution?

[@VISHALMISHRA-ff2ih]

What an explanation Sir🔥🔥. Question is hard due to the part of finding the path for the maximum sum.

[@techdose4u]

yes
thanks :)

[@sailendrachettri8521]

Thank you sir ;)

[@techdose4u]

welcome:)

[@lakithakare7387]

instead of prefix sum, we can simply calculate the sum of each windows and store it, that would be simpler I beleive.

[@techdose4u]

wouldnt that be N^2 ?

[@4nuragKr]

@@techdose4u no, O(n) only, we apply sliding window algorithm to calculate sum of windows until the last possible window for given k.

[@taskeen_fatimaa]

Thankyou sir great explaination

[@techdose4u]

welcome :)

[@godFather-123-b8g]

what a great explanation

[@techdose4u]

Thanks :)

[@Abhishek-e6d2c]

What an explanation sirji!!!

[@techdose4u]

Thanq Ji :)

[@swatidubey493]

helpful

[@techdose4u]

Glad it helped

[@SurajSharma-ur6rm]

Why can't be use memo array values to find the path? If its already containing the max sum for each idx,count. Then instead of calling recursion when finding path, we can just used the memo array values right?

[@techdose4u]

Its the same logic.
You may have to take Count = 4 in that case to cover all cases from 0 to 3.
Your idea will work too.
Please use table instead of calling memoization :)