You are doing a great job!! thank you!, most youtubers don't cover these topics.... i hope in future videos you will cover problems on bitmask dp and other forms of tree queries
Awesome man.... awesome. Really helpful and explanation is to the point. The one generic template for DP on trees you have discussed so far in your playlist is applicable everywhere.
Crystal clear explanation. Following this entire playlist to learn dp on trees. Thank you so much for making videos on these rare but important topics.
Hi, one doubt when you are counting the no of nodes at 14:07, for any child you are counting the no of nodes at dist k from its child and from its parents. But won't there be some nodes which are at dist k from child ch which are from the parent of parent... Hope you got my point
I do think I understand your doubt. Are you asking about why don't I account the nodes that are at a distance of k-2 from parent of parent? If that's your doubt then those nodes are already accounted for. How? The nodes which are at distance k-2 from parent of parent are at distance of k-1 from parent which we are taking into account. I suggest taking a pen and paper and trying to convince yourself of the validity and if still you have some doubt I'll be happy to help :)
ou are doing a great job!! thank you!, most youtubers don't cover these topics.... i hope in future videos you will cover problems on bitmask dp and other forms of tree queries
You are doing a great job!! thank you!, most youtubers don't cover these topics.... i hope in future videos you will cover problems on bitmask dp and other forms of tree queries
I will try my best and yes dp with bitmask is most likely the next topic to be covered.
Awesome man.... awesome. Really helpful and explanation is to the point. The one generic template for DP on trees you have discussed so far in your playlist is applicable everywhere.
Crystal clear explanation. Following this entire playlist to learn dp on trees. Thank you so much for making videos on these rare but important topics.
Glad to know that, hope that you get to learn some useful techniques :)
I will submit my code and get accepted was my favorite part. Great Explanation
This was amazing, waiting for other CSES tree dp problems :)
Thanks sir, this is a very good initiative taken by you. I really needed this information
can we have the list of tree dp questions list like these , would be very helpful ..
Thanks for making such awesome content. Please continue posting more videos and content related to dp on trees.
Thankyou Kartik🫡
really nice and clear explanation sir
thanks sir:) it was my wish that you could start a playlist on random codeforces problem solving.
I am glad that you are enjoying the content!
Hi, one doubt when you are counting the no of nodes at 14:07, for any child you are counting the no of nodes at dist k from its child and from its parents.
But won't there be some nodes which are at dist k from child ch which are from the parent of parent... Hope you got my point
I do think I understand your doubt.
Are you asking about why don't I account the nodes that are at a distance of k-2 from parent of parent?
If that's your doubt then those nodes are already accounted for. How? The nodes which are at distance k-2 from parent of parent are at distance of k-1 from parent which we are taking into account.
I suggest taking a pen and paper and trying to convince yourself of the validity and if still you have some doubt I'll be happy to help :)
@@AlgosWithKartik yes it clears
how can we implement it if there are multiple values of k?
superb explanation broooooo
Just Awesome !
Interesting problem !
ou are doing a great job!! thank you!, most youtubers don't cover these topics.... i hope in future videos you will cover problems on bitmask dp and other forms of tree queries
We already have a playlist on bitmask dp :)
Sir why you use (d-2) for children?
very well explained bro .. thanks a lot
You're welcome
Please can you share must learn topics to become good at competitive programming
Please
Also share most useful techniques
Surely, stay tuned.
Congratulations for 1k i am 1kth subscriber💥
Thankyou Ankit
@@AlgosWithKartik i am here at 34.8 K :)
Thanks, this was really helpful!
You're welcome :)
Nice Algorithms
Please make a video on ur cp journey
Yes I have planned to add videos on my CP journey, my Interview experiences and more :)