Number Of Rectangles That Can Form The Largest Square Problem

Number Of Rectangles That Can Form The Largest Square Problem — ExecCode Easy DSA Practice

Solve the Number Of Rectangles That Can Form The Largest Square problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an array rectangles where rectangles[i] = [li, wi] represents the i^th rectangle of length li and width wi. Your task is to compute the required answer and return the number of rectangles that can make a square with a side length of maxLen. You can cut the i^th 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.

Examples

Input {"rectangles": [[5, 8], [3, 9], [5, 12], [16, 5]]}; Output 3. Input {"rectangles": [[2, 3], [3, 7], [4, 3], [3, 7]]}; Output 3

Constraints

1 <= rectangles.length <= 1000 rectangles[i].length == 2 1 <= li, wi <= 10^9 li != wi

Practice Number Of Rectangles That Can Form The Largest Square free on ExecCode. Browse DSA problems, topic map, and placement guides.