73. Unique Triangle Segments

Hard

faces is a (m, 3) array of triangle vertex indices. Find the set of unique line segments composing all triangles. Return them as a sorted (k, 2) array (each segment sorted ascending, then unique rows).

Implement solve(...)