I have never seen such a hard DP problem. The idea was very nice and wonderfully explained.
@AlgosWithKartik
3 жыл бұрын
Thanks Priyansh!
@saurabhsharma7123
3 жыл бұрын
I must say that these lectures are better than paid ones. Keep up the novel work. Really appreciate it.
@AlgosWithKartik
3 жыл бұрын
Thanks man :)
@mrtourist8066
3 жыл бұрын
My finger goes to the like button even without seeing the video cause I already know that any video made by you will be awesome thanks bro I already solved this question but your explanation rocks 🔥
@AlgosWithKartik
3 жыл бұрын
Thanks for the support tourist ;)
@nikunjgarg6636
2 ай бұрын
Your lectures are really very interesting and taught well!
@coding8000
2 жыл бұрын
Saw 5 videos on same topic, ur explantion is best on internet.
@ankitvermaiitism5700
3 жыл бұрын
the best video tutorials for DP
@shadalam5092
2 жыл бұрын
Very nice explanation. Your way of approaching the hard problem is great. I got it it's all fundamental and clarity before writing code. Thanks bhaiya it help me alot.
@anubhavkalia5130
3 жыл бұрын
Its true that dp on trees is intresting and I too gained interest in this topic from this channel.
@coding_insight
3 жыл бұрын
I am enjoying very much in dp on trees tutorial
@coding_insight
3 жыл бұрын
Your all videos have super explanation 👍👍👍
@paawansingal788
3 жыл бұрын
your all videos are very helpful :) thanks a lot
@vijaykumarlokhande1607
3 жыл бұрын
Amazing Explaination!!
@rishabhkumar8115
2 жыл бұрын
Please make more of these videos
@anuragchaudhary31
3 жыл бұрын
At 17:35 , the first equation is wrong I think...which you corrected in the second eqn. (basically, these two are not equal) eg.: (2*3)+(2*3) is not same as (2+2)*(3+3)...Please correct me If I'm wrong. PS: Your videos are best.
@AlgosWithKartik
3 жыл бұрын
thanks for the correction. you are right those two are not equivalent.
@jonathanalvarado8007
6 ай бұрын
I subscribed bro thank you for your good work
@vishalsingh-xx3ii
Жыл бұрын
sir at the time when we added subtree thats have white component to black component after adding one white component the remaining portion also be divided in to different black component but why you are taken it
@gurharpartapdhaliwal3087
3 жыл бұрын
And to reach CM on cf we need to solve these kind of problems in the live contest🥶
@AlgosWithKartik
3 жыл бұрын
Either till E or till D but with a very good pace
@gurharpartapdhaliwal3087
3 жыл бұрын
@@AlgosWithKartik D of difficulties 1700?
@sujoyseal195
3 жыл бұрын
Completed your playlist. DP on trees is now my girlfriend. P.S A small doubt : Is pi( DP (black)) + pi(DP(white)) = pi(DP(black)+DP(white)) ?? I think this is wrong please check.
@AlgosWithKartik
3 жыл бұрын
yeah that's a mistake from my side. Correct recurrence is pi(DP(black)+DP(white)) as seen in the code part. btw congrats on your new relationship :D
@sujoyseal195
3 жыл бұрын
@@AlgosWithKartik Thanks
@DeepakKumar-pv2jn
3 жыл бұрын
Your videos is always 🔥
@OneWayReality
3 жыл бұрын
Bhaiya, if we need to solve dp_black(u) then why we're counting dp_black(child of u)? Because, condition given that only one node should be black in a component/set so here root node u is already black so here from my perspective, we don't need to count for child nodes which are black as well or subtree contains black node. So hope you're getting, what I'm trying to say. Please correct me if I'm wrong.
@AlgosWithKartik
3 жыл бұрын
To calculate dp_white(u) you will need to know the values of dp_black(child of u) Hope this helps. I feel I don't properly understand the doubt. Incase you feel there is something incorrect please reframe your doubt and I'll try to answer better.
@OneWayReality
3 жыл бұрын
Thik hai Bhaiya, dp_black(u) where u is black, ka mtlb hai ki, number of components jaha peh node [u] root hai and components containing only one black node. So, abhi agar root node bhi black hai in a Tree, tab recurrence relation hoga: dp_black(u)=Pi of (dp_black(child of u)+dp_white(child of u)) Right?
@AlgosWithKartik
3 жыл бұрын
@@OneWayReality yes yeh toh perfect lgg rha
@OneWayReality
3 жыл бұрын
Toh mera doubt yah tha ki, dp_black(u)=Pi of (dp_black(child of u)+dp_white(child of u)) Iss relation meh, dp_black(child of u) iska kyun jarorat hai? Kyun ki, [dp_black(child of u)] iss term ko bhi agar add kar liya tab components meh more than one black node ho jayega na, Bhaiya.
@AlgosWithKartik
3 жыл бұрын
@@OneWayReality suppose krro humne 1 component bas root ko maanliya Ab agar root ke 5 child nodes the toh humare paas 5 subtrees hai jinke liye orignal problem solve krrni h
@ankitpandey3724
3 жыл бұрын
Its true very true 😁
@AlgosWithKartik
3 жыл бұрын
Which part :D
@ankitpandey3724
3 жыл бұрын
@@AlgosWithKartik Let me know if this DP on trees series is interesting in the comment section 😁
Пікірлер: 39