Maximum Subarray - LeetCode 53 - JavaScript

[@EsTean95]

This was beautifully explained. Seeing the illustration must've been the biggest blessing of the day. Thank you so much!

[@AlgoJS]

Thanks, you're welcome!

[@samudraperera6546]

You are a coding god man, literally saving me during the interview leetcode grind

[@amotekundev]

How did the interview go?

[@ahmedaz6917]

I want know In JS, the 'bind' method immediately invokes the function upon which it is called on. true ? and want know One of the traditional ways of keeping variables private was using an IIFE around the code . true ?

[@AlgoJS]

So the 'bind' method returns a bound function that, when executed later, will have the correct context ("this") for calling the original function. And yes, one of the primary uses of IIFE's is to keep variables private along with closures.

[@amorfati4559]

Damn, I've been trying to solve this for forever, and the solution is so simple. How do you go about determining if there is a recurrence relation, or what it is?

[@AristotelianLogic]

The proof is in the pudding when it comes to dynamic programming. Recurrence relation is that the current max at any index will be the max irrespective of the subset picked.

[@dragonborn1996]

This is a medium problem now

[@krishnachaitanya7138]

We can do this problem taking two variables sum and max as well using a single for loop instead of DP.

[@0xTRellyx0]

Can you link the solution?