← All problemsSign in

Bus Stop

Pune city has N different tourist spots(numbered from 1 to N), each tourist spot has a bus stop. The tourist management has N-1 buses ,each operating between a fixed pair of stops( in both the directions). Thus, in order to travel between any two spots one might have to take several buses. In fact, since the management has made sure that it’s possible to travel between any pair of tourist spot, th

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start