Search
⌘K
Get Premium
Leetcode 1240. Tiling a Rectangle with the Fewest Squares
Given an n×m rectangle (1 ≤ n,m ≤ 13), find the minimum number of integer-sided squares needed to exactly tile it. The core challenge is a combinatorial packing/covering optimization — typically solved with exhaustive search plus pruning or DP/memoization to handle the exponential search space.
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.