← Questions
Distance from every node to the cycle
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A connected graph contains exactly one cycle. For every node, return its distance to the nearest node on the cycle. Find the cycle by trimming leaves, then run a multi-source BFS outward. Only the title of this report was public; the details follow the common version.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding