Number Of Rectangles That Can Form The Largest Square at Allincall
Easy79.3% acceptance
This problem has 100.0% frequency at Allincall.
Problem Description
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...
Read full problem and hints