Question Details
Problem Find a valid travel itinerary that uses all tickets exactly once in lexicographic order (Eulerian path). Likely LeetCode equivalent LC 332 (Reconstruct Itinerary) is the direct match. Tags graph, DFS, Eulerian-path
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Coding
Phone
More from Rippling
Reddit
Rippling SDE-2 Phone Screening (Reject)
1p3a
Rippling Software Engineer Interview Experience: AI Coding Rounds and Offer
Reddit
Rippling Fullstack SWE Intern Interview
1p3a
Rippling Fulltime SDE Video Interview Experience: Expense System Challenge
1p3a
Rippling Senior SDE Onsite Interview System Design and Coding