Leetcode 2097. Valid Arrangement of Pairs

Given directed pairs [u,v] as edges, order all pairs so each edge's end equals the next edge's start — this is equivalent to finding an Eulerian trail/path in the directed multigraph formed by the pairs (existence is guaranteed).