dsa7 min read
Reconstruct Itinerary — Hierholzer's Eulerian Path Algorithm [LC 332, Google, Meta, Amazon]
Master LeetCode 332 Reconstruct Itinerary using Hierholzer's algorithm: a single DFS that traverses every edge exactly once and assembles an Eulerian path via post-order insertion. A FAANG hard interview classic asked at Google, Meta, and Amazon, and the foundational pattern for de Bruijn sequences and DNA fragment assembly.
Read →