Building Recursion Mindset | Day 1 Part 1 | Dynamic Programming workshop | Vivek Gupta

[@amansabale4025]

Today I saw the difference between a DSA teacher and a CP teacher, loved your concept/format to understand recursion.

[@lakshyamittal3098]

Truee, the depth of understanding is just on a different level.

[@amansabale4025]

@@lakshyamittal3098 true that, even though I have done recursion and dp, this format never occurred to me, I think it comes with the grind.

[@gautham7244]

No one taught the concept of level, choice,check and move in the entire KZbin directly....Loved the video....Thanks a lot mate ❤️

[@abhinavkumar5298]

Day1 Let's Go!

[@gauravupreti4398]

Awesome explanation 🔥🔥

[@techDude1401]

Loved the it!, more and more content like this. And also, please make video how , when and at level we can start giving contest and tips and tricks. It will be very helpful for us bhaiya.

[@hisokamorow6781]

👍👍👍👍👍👍just awesome...👍👍👍

[@homosapien14733]

best Video 🔥 , thank you

[@Sandeep-zd6dq]

Who all thought of greedy solution in example 3 just after seeing the problem (sorting)😂 even we know that it won't work. but now i will always formulate problems in LCCM framework before proceeding to the solution.

[@shashwatmishra4342]

Hi, in the third example you discussed could we also model the dp states or levels as follows: dp[i][t][ct]=max skill you get from first i tasks given you have atmost t time and you have ct slots rather than modelling as a subset? I guess the transitions then can be: dp[i][t][ct]=max(dp[i-1][t][ct],dp[i-1][t-time[i]][ct-1]+skill[i])

[@rachakondaeshwar4129]

Very interesting

[@codingwithanonymous890]

best explanationv

[@shreyajha2066]

Done

[@sseu123]

Day 01 start

[@Dr.dhumketuIITDholakpur]

having a doubt , like when the recursion will happen and the function will call itself then everytime the value of ans will be zero and that don't makes any sense to me so can please help me to fix that out ?

[@abhishek04204]

can you link some good problem of recursion ? Thank you

[@bruteforce2434]

Great video. How do you know whether a problem is greedy or dp? This is something i often struggle with. Could you take this up in detail in one of the sessions? It would really help.

[@vivekgupta3484]

Yes... for now let's assume its DP (as we are DP workshop)... next we will learn that too.

[@simranvedpathak7112]

Thankyou !

[@theuntoldtree]

Bhaiya bs ab ek aisa graph ka bhi le aao

[@CpWithSunil]

Sir, Why I'm getting tle on correct code on your platform?

[@Code_With_Goat]

Practice link not working please help

[@nikhilkumarv2577]

🛐

[@redcoder9428]

day 2 ka vidoe nahi ane wala?

[@Abhishek-fo3fc]

DAY 1 PART 1 DONE

[@AmanChauhan-hr1wh]

anyone took notes...can you pls share??

[@rohandsouza9147]

Acraider orz

[@justlc7]

Is this the same content as in your course?

[@vivekgupta3484]

This is sort of 1 week of 4 week content on DP.

[@justlc7]

@@vivekgupta3484 got it, and I also wanted to check does the course have codes in python, as I want to do CP etc. in python only

[@vivekgupta3484]

@@justlc7 No, the course is in C++ mostly.

[@yagniktalaviya2146]

Problem link is 404....Thanks for the video

[@vivekgupta3484]

Make sure that you have registered first.

[@yagniktalaviya2146]

@@vivekgupta3484 Registration (bitly) link is also not working

[@vivekgupta3484]

@@yagniktalaviya2146 use algozenith.com/dpworkshop

[@duck3072]

Linked list after dp please 🙏

[@funnyvalentine123]

Last one is 0/1 knapsack

[@vivekgupta3484]

Yes... with some twist :D

[@rachakondaeshwar4129]

@@vivekgupta3484 recently taught again iicpc a similar version

[@vivekgupta3484]

@@rachakondaeshwar4129 Yes. the same only.

[@tusharsolanki8564]

Recursion ka logic hee nhi banta yr

[@vivekgupta3484]

Thoda practice mangta hai ye topic!