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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.