3311. Construct 2D Grid Matching Graph Layout
3311. Construct 2D Grid Matching Graph Layout
Description
You are given a 2D integer array edges
representing an undirected graph having n
nodes, where edges[i] = [ui, vi] denotes an edge between nodes ui and vi.