Number Of Rectangles That Can Form The Largest Square.cpp

// Runtime: 36 ms (Top 59.51%) | Memory: 18.70 MB (Top 69.73%)

class Solution {
public:
    int countGoodRectangles(const vector<vector<int>>& rectangles) {
        
        int side=0, maxLen=0, count=0;
        
        for(const auto& i:rectangles) {
            
            side=min(i[0],i[1]);
            
            if(maxLen<side) {
                maxLen=side;
                count=1;
            }
            else if(maxLen==side) ++count;
        }
        
        return count;
    }
};