The last problem from today's Codechef starter dealt with diameter of weighted trees. So I created a video discussing the general ideas behind computing diameter of weighted/unweighted tree, and the farthest node from each node (using ideas from this amazing blog by TheScrasse )
https://youtu.be/UhhIFuHhllE?si=mpzEwZwm9py7OgFT
3 Practice Problems :
D is good problem , idea graph of diameter 3.
C my English is bad, I always confuse “at most” and “at least”.