Practice45 min
Practice: Hard Path Structures
Lexical Eulerian paths, minimax elevation Dijkstra, and character-precedence topological sort.
Three hard structural problems: Hierholzer's edge-consuming DFS, Dijkstra scored by max() instead of sum, and building an alphabet from word-order evidence with topological sort.