Search
⌘K
Get Premium
Leetcode 3537. Fill a Special Grid
Construct a 2^n x 2^n permutation of integers 0..2^(2n)-1 so that the four quadrants (top-right, bottom-right, bottom-left, top-left) have strictly increasing value ranges (top-right < bottom-right < bottom-left < top-left) and each quadrant itself is recursively a special grid; return any grid satisfying this for n ≤ 10.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.