Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Count Paths That Can Form a Palindrome in a Tree
Coding · Bit Manipulation · Depth-First Search · Hash Table
- Count Triplets That Can Form Two Arrays of Equal XOR
Coding
- Find the Largest Area of Square Inside Two Rectangles
Coding
- Form Largest Integer With Digits That Add up to Target
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1725. Number Of Rectangles That Can Form The Largest Square
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source