Solidify the DP Formulation! | Day 2 Doubt Session | Dynamic Programming | Vivek Gupta

In this DP workshop, we are going to learn many DP formulations that are going to make solving DP problems easy for you. Register today if you haven’t.
🔴 Practice Problem Link: www.learning.a...
🔴 Registration link for the Workshop: algozenith.com...
🔴 Discord for Discussion: / discord
✨ Hashtags ✨
#VivekGupta #dpworkshop #CPStreams #codechef #codeforces #engineering #internship #DSA
____________________________________________________
Linkedin: / vivekgiit. .
Instagram: / acraider_here

[@shahnaj6102]

give the link for cleaning window problem please

[@Live-hh6li]

Solved all
Though I did cses DP
But these problems were refreshing
Thanks Vivek

[@satyampatidar5848]

22:40
we can reduce the space to O(N*W)
In the transition part
for(int take=0;taken

[@Ramu9119]

Great Video man
Very nice

[@adityamishra4458]

These session helps develop thinking. Great bro. Waiting for more and more content from you

[@blitztour5924]

Solved Brick Colouring on my own🤤 Felt Amazing
Thank you for this series.
Though that long long thing took me some time to figure out😂

[@utsavupadhyay2237]

Great explanation 👍

[@SiddhantKadam-vn2tk]

thank you vivek bhai for the sereies you are clearing all the concept and the quiz section which you take in begining is unique and good brush up for session

[@nce2910]

Great Session💥

[@chiranjeevbansal4971]

at 17:09 , i dont get the use of min(Wsum , W) ,especifically the use of Wsum

[@partha231]

Great discussion 😊

[@sakshamgulati5854]

the series is amazing bhaiya. so many previous doubts being cleared up in each video and so many new things to learn!
bhaiya its a great effort by you. thank you very much🙏🙂

[@vardanverma6072]

great 🔥🔥

[@jeevansingh5170]

Thanks for sharing . It helps a lot.

[@keshav2902]

*hey bro, excellent session* 🤗

[@theuntoldtree]

i was able to think 3rd prblm : )

[@aaryanjavalekar7249]

I have a doubt. While calculating complexity we multiply the max limit of the parameters passed and multiply this with (1+transition states). But what if some parameters passed are co-dependent? Then the time complexity would depend on only one of the co-dependent pair of elements right?

[@debanjanbarman7212]

nice

[@soumadipsaha9036]

At 22:34 if I don't take the next item why the sum doesn't become zero since we are starting all over again to take the items?

[@mayankmewar5049]

nice session

[@rahulyela]

hey vivek , I tried a lot figure out the dp state for below question but couldn't able to do that can u help me to find the dp state.
Alexa to color all the walls on the occasion of New Year. Alexa can color each wall with one of the K colors. The cost associated with coloring each wall with a particular color is represented by a 2D costs array of size N * K. For example, costs[0][0] is the cost of coloring wall 0 with color 0; costs[1][2] is the cost of coloring wall 1 with color 2, and so on... Find the minimum cost to color all the walls such that no two adjacent walls have the same color.
TC-----> (N*k)

[@vivekgupta3484]

dp(i,last colour used) … transitions can be made O(1) using optimizations

[@rahulyela]

@@vivekgupta3484 can u explain how transitions can be made O(1)?

[@vivekgupta3484]

You will have to maintain previous i's 2 best shops. If the best one is of the same colour, take the second best.@@rahulyela

[@rahulyela]

@@vivekgupta3484 Got it vivek 👍
Thanks for replying ❤️

[@cricketlive2752]

"Something in Input that changes through test cases then we can't cache it" can someone explain it more please?

[@mowafkmha4505]

can someone provide recursive code for the third problem

[@Mahakaal17_]

Bricks colouring problem?

[@abhinav7314]

👍

[@himanshumishra6253]

Going to Practice Problem Link says 404 error. Can you please fix it.

[@siddharthsaurav3657]

Cfbr

[@KarteHainKucch]

+1

[@arindam_maji]

:)