Interview Experience
LeetCode #332: Reconstruct Itinerary. Difficulty: Hard. Topics: Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit. Asked at Compass in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a candidate experience report from a compass interview for a swe role during the coding round.
It covers the following topics: Depth-First Search, Eulerian Circuit, Graph Theory, Heap (Priority Queue), Arrays, Graph, Heap, Queue, Sorting, Strings .
Difficulty rating: Hard