add 2352

fishercoder1534 · fishercoder1534 · commit 304ba8fe71fb · 2022-07-24T08:09:59.000-07:00
diff --git a/README.md b/README.md
@@ -8,11 +8,12 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
-| 2351 |[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2351.java)                                                                      || Easy                                                                             ||
-| 2347 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/best-poker-hand/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2347.java)                                                                     || Easy                                                                             ||
-| 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java)                                                                     || Easy                                                                             ||
-| 2335 |[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2335.java)                                                                     || Easy                                                                             ||
-| 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java)                                                                     || Easy                                                                             ||
+| 2352 |[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2352.java)                                                                     || Medium                                                                          ||
+| 2351 |[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2351.java)                                                                     || Easy                                                                          ||
+| 2347 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/best-poker-hand/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2347.java)                                                                     || Easy                                                                          ||
+| 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java)                                                                     || Easy                                                                          ||
+| 2335 |[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2335.java)                                                                     || Easy                                                                          ||
+| 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java)                                                                     || Easy                                                                          ||
 | 2326 |[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2326.java)                                                                     || Medium                                                                        ||
 | 2325 |[Decode the Message](https://leetcode.com/problems/decode-the-message/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2325.java)                                                                     || Easy                                                                          ||
 | 2319 |[Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2319.java)                                                                     || Easy                                                                          ||
diff --git a/src/main/java/com/fishercoder/solutions/_2352.java b/src/main/java/com/fishercoder/solutions/_2352.java
@@ -0,0 +1,36 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class _2352 {
+    public static class Solution1 {
+        public int equalPairs(int[][] grid) {
+            Map<List<Integer>, Integer> rows = new HashMap<>();
+            for (int i = 0; i < grid.length; i++) {
+                List<Integer> row = new ArrayList<>();
+                for (int j = 0; j < grid[0].length; j++) {
+                    row.add(grid[i][j]);
+                }
+                rows.put(row, rows.getOrDefault(row, 0) + 1);
+            }
+            Map<List<Integer>, Integer> columns = new HashMap<>();
+            for (int j = 0; j < grid[0].length; j++) {
+                List<Integer> column = new ArrayList<>();
+                for (int i = 0; i < grid.length; i++) {
+                    column.add(grid[i][j]);
+                }
+                columns.put(column, columns.getOrDefault(column, 0) + 1);
+            }
+            int pairs = 0;
+            for (List<Integer> row : rows.keySet()) {
+                if (columns.containsKey(row)) {
+                    pairs += rows.get(row) * columns.get(row);
+                }
+            }
+            return pairs;
+        }
+    }
+}
