feat: [LeetCode #2352] Equal Row And Column Pairs

Тип: HashMap
Сложность: Medium
Временная сложность: O(n^2)
Пространственная сложность: O(n)

-

Ссылка: https://leetcode.com/problems/equal-row-and-column-pairs/

Author: onixlas

src/hashmap_set/equal_row_and_column_pairs/__init__.py

@@ -0,0 +1,19 @@
+from typing import List
+from collections import defaultdict
+
+
+class Solution:
+    def equalPairs(self, grid: List[List[int]]) -> int:
+        count = 0
+        hash = defaultdict(int)
+
+        for row in grid:
+            hash[str(row)] += 1
+
+        for col_index in range(len(grid[0])):
+            col = []
+            for row_index in range(len(grid)):
+                col.append(grid[row_index][col_index])
+            count += hash[str(col)]
+
+        return count

src/hashmap_set/equal_row_and_column_pairs/solution.py

@@ -0,0 +1,16 @@
+import pytest
+from src.hashmap_set.equal_row_and_column_pairs.solution import (
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    "grid, expected",
+    [
+        ([[3, 2, 1], [1, 7, 6], [2, 7, 7]], 1),
+        ([[3, 1, 2, 2], [1, 4, 4, 5], [2, 4, 2, 2], [2, 4, 2, 2]], 3),
+    ],
+)
+def test_equal_pairs(grid, expected):
+    solution = Solution()
+    assert solution.equalPairs(grid) == expected