Reconstruct Itinerary Without Fixed Start (Eulerian Path)

Phone ScreenCitadelLast reported September 2025Low Frequency
Reported
1× across candidate reports
First seen
September 2025
Last reported
September 2025
Reported outcome
unknown

Problem Overview

Like LeetCode 332, Reconstruct Itinerary, but no starting city is given. You are given a list of one-way tickets from -> to. Return an itinerary, a sequence of cities, that uses every ticket exactly once. Example (as posted) The candidate chose the input and output format, and the round was…

  • The rest of the problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Citadel catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Citadel question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?