LeetCode Experience

#332 Reconstruct Itinerary

Interview Experience

LeetCode #332: Reconstruct Itinerary. Difficulty: Hard. Topics: Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit. Asked at Salesforce in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Depth-First Search Eulerian Circuit Graph Theory Heap (Priority Queue) Arrays Graph Heap Queue Sorting Strings