Number Of Rectangles That Can Form The Largest Square
The task requires determining the maximum possible square’s side length that can be formed from a set of given rectangles. Each rectangle can be cut down to a square with a side length equal to the smaller side of the rectangle. The function should return the number of rectangles that can make a square with this maximum possible side length.
You can solve this problem using the following steps:
Traverse each rectangle in the list, and for each rectangle, get the minimum of length and width, which would be the maximum possible side length of the square that can be cut from this rectangle.
Keep track of the maximum square side length obtained so far.
Count how many rectangles can form a square of this maximum side length.
Let’s translate these steps into Python code:


The time complexity of the above solution is O(n), where n is the number of rectangles, since we traverse the list of rectangles once. The space complexity is O(1), as we only use a fixed amount of space to store the max_len
and count
.