Available question text
Given an undirected graph that is guaranteed to be isomorphic to a 2D grid, reconstruct a 2D arrangement placing each node exactly once so that two nodes are adjacent in the grid iff there is an edge between them. Return any valid grid layout.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3311. Construct 2D Grid Matching Graph Layout
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source