A Tour of Westeros

CodeChefOpen on judge ↗

The Night King has arrived. This time, instead of being creepy, Bran has decided to inform all the kingdoms about the Night King. Therefore he sends out a raven for the same. Westeros has N kingdoms, each denoted by a integer from 1 to N. These kingdoms are connected by M paths. The raven (messenger) has to visit all the kingdoms. He does this by following certain set of rules. - He always starts

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