📌Fastest & Easy Java☕ solution using hashmap
```\nclass Solution {\n    public int countGoodRectangles(int[][] rectangles) {\n        HashMap hmap = new HashMap<>();\n        int k=0;\n        for(int rect
```\nclass Solution {\n    public int countGoodRectangles(int[][] rectangles) {\n        HashMap<Integer,Integer> hmap = new HashMap<>();\n        int k=0;\n        for(int rectangle[]:rectangles)\n        {\n            int min = Math.min(rectangle[0],rectangle[1]);\n            if(min>=k)\n            {\n                k = min;\n                hmap.put(min,hmap.getOrDefault(min,0)+1);\n            }\n        }\n        return hmap.get(k);\n    }\n}
['Java']