The Magical DP Framework | Day 2 Part 1 | Dynamic Programming workshop | Vivek Gupta

[@codingwithanonymous890]

sir please teach graphs also after dp :)

[@mowafkmha4505]

I'm amazed by this one in a billion quality content

[@try_bunny_10]

Interesting for me is that, i have already coded in same way AZ Workshop problem, in video 2nd already

[@abhishekpant5545]

When ever you code in sublime the [Finished in 2.7s] screen take significant space of screen. So if you can minimize the size of it somehow it will be better.

[@eyra7550]

Amazing ! Can you please teach tree and graphs after dp ??

[@bangali773]

Present 🔥

[@deyp11]

Just want to thank you for your efforts🎓🎓, You should write a book on programming. 📖📖 This is the most underrated channel for programming🧢. Please do not delete the videos , thanks in advance.

[@parthivsarkar6835]

The mistake is already corrected , I see . Overall the video is was nice , now going to practice the sample problems . Thanks for such a amazing workshop

[@dharsan.s7937]

Their is minor mistake its Should return Max of two ans

[@vivekgupta3484]

Yes thats correct … thanks for pointing it out for all.

[@ankitshaw_3060]

if possible then pin these comment i also had the same doubt...and thanks for the content❤❤@@vivekgupta3484

[@dank7044]

This was beatiful.

[@vineettanwar7880]

please do a lot of questions for every form.

[@GautamKumar-lm3qx]

plz make a detailed video on things(cp,open source,devlopment etc.) u did in ur second year ,third year and so on.

[@GautamKumar-lm3qx]

nice video bhaiya

[@modiji8706]

DONE✅✅

[@sababmuhammad4842]

clear

[@AmzingFacts7162]

cout

[@vivekgupta3484]

Yes. We start with the 0th (1st element) index.

[@i_am_wiz]

Can you please share the proof for the expression of Time complexity??

[@bhaveshsuthar4957]

Bhaiya! Could you please tell how can we come up with the formula you used for the time complexity in the video? Is it possible to get the formula using recurrence relation?

[@nikhilkumarv2577]

🛐

[@vineettanwar7880]

if we do min instead of max we will get minimum skill gained given the constraints.(am i right)

[@Coder_DhruvArora]

But Minimum is always 0, so there is no sense to calculate minimum

[@anonymousanonymous7507]

it should be max

[@pprraakkhhaarr]

Link to third problem ?

[@FinanceMode14]

the practice links are not working

[@SiddhantKadam-vn2tk]

min should be max maza aya 3rd day

[@shivamchauhan029nitjsr4]

Practise Questions are inaccessible. :( Please help bhaiyya

[@roushankumar3532]

it will only work for +ve array🙂

[@sseu123]

niceeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee

[@rss2772]

what does pruning mean?

[@vivekgupta3484]

removing unnecessary recursion path that we know wont yeild result?

[@aryanbarnwal5645]

practice problem link not working

[@vivekgupta3484]

You will have to signup at learning.algozenith.com

[@radicalengineer2331]

bro this is no longer a backtracking code then why are you doing memset? Btw your teaching is so elegant, that I can't express it in words.

[@vivekgupta3484]

To set the initial values of the DP array to -1.

[@itz_me_imraan02]

It should be max i guess 🙄

[@vivekgupta3484]

Yes.. great to see you all are attentive.

[@rv__info7876]

+1