Search
⌘K

Leetcode 1725. Number Of Rectangles That Can Form The Largest Square

For each rectangle, its largest possible square side is min(length, width); find the maximum of these minima across all rectangles and return how many rectangles achieve that maximum side length.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.