AlgoTalks Episode - 1! || Solving Interesting Dynamic Programming Problems

[@anirudhmittal80]

Definitely needed this thanks, please continue it

[@Trax2551]

We need more sessions on DP please

[@aaravarya4406]

Was waiting for the upload, finally it's here👍

[@md.jarifahsan1003]

quality content , do more please

[@Harisamsharma]

Sure, thanks!

[@justvibing9663]

Awesome 😎

[@SouravKumar-rg4yj]

Sir please made this type topic discussion in future...

[@ayushagarwal4253]

Can you also solve the problem given in CLRS 4th edition 14-12, Free-agent Signing Problem as an example?

[@rudranilacharya5293]

Thank you very much

[@shashwatsrivastava5332]

I didnt get that singelton element thing in first question

[@Hari-ko5ry]

Bring DP series from scratch please

[@FinanceMode14]

why the answer cannot be negative ? i we have a subarray with zero sum then it can be

[@Harisamsharma]

Its given that the value of an empty array is 0

[@FinanceMode14]

@@Harisamsharma ok got it

[@swastik07]

Kadane algorithm + for loop for summing of the k[r-l+1/m] we know the r,l because we have found the subarray. O(n)

[@md.jarifahsan1003]

I got wa on test 8 using kadane , can you provide your implementation?

[@adityajain8535]

it won't work because kadane algorithm will just provide the maximum sum subarray, not the subarray with the maximum value.