Practice Number Of Rectangles That Can Form The Largest Square
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an array rectangles where rectangles[i] = [li, wi] represents the ith rectangle of length li and width wi. You can cut the ith rectangle to form a square with a side length of k if both k <= li and k <= wi. For example, if you have a rectangle [4,6], you can cut it to get a square with a side length of at most 4. Let maxLen be the side length of the largest square you can obtain from any of the given rectangles. Return the number of rectangles that can make a square with a side length of maxLen.
Source: Number Of Rectangles That Can Form The Largest Square on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
rectangles = [[5,8],[3,9],[5,12],[16,5]]
3
# Example 2
rectangles = [[2,3],[3,7],[4,3],[3,7]]
3
Constraints
Related LeetCode Problems
Practice more problems similar to Number Of Rectangles That Can Form The Largest Square.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.