This post was flagged by the community and is temporarily hidden.
This post was flagged by the community and is temporarily hidden.
This post was flagged by the community and is temporarily hidden.
This post was flagged by the community and is temporarily hidden.
Most of them solved all.
There’s an edge case when both nodes lie in same path
Nope there isn’t
Can anyone send in some source which explains calculating diameter of a graph.
I also solve all .
Search for two bfs method. It’s pretty straightforward IMO.
Hey any idea when the results will be declared?

I solved all, but like I was super sleepy so it took me 3.5 hours to solve them all lmao, easy stuff tho, and no I didn’t binary lift, I used segment tree on euler tour
Looking at the posts, it seems that most of the people solved all
. So they may select only those candidates who solved all 5. Which means I have no chance, because I could only solve 3.
please watch video of CodeNCode (best for Binary Lifting)
Is it only for 4th-year undergrads?
can you please help me with Chemical Explosion Problem. Which concept is used to solve it. Whatever help you can provide me will be appreciable
Problem Link
OMG, are you serious? 