feat: [LeetCode #1657] Determine If Two Strings Are Close (#22)

Тип: Hashmap
Сложность: medium
Временная сложность: O(n log n + m log m)
Пространственная сложность: O(n + m)

-

Ссылка: https://leetcode.com/problems/determine-if-two-strings-are-close/

Author: onixlas

src/hashmap_set/determine_if_two_strings_are_close/__init__.py

@@ -0,0 +1,17 @@
+from collections import Counter
+
+
+class Solution:
+    def closeStrings(self, word1: str, word2: str) -> bool:
+        word1_counter = Counter(word1)
+        word2_counter = Counter(word2)
+
+        return (
+            sorted(word1_counter.values()) == sorted(word2_counter.values())
+            and word2_counter.keys() == word2_counter.keys()
+        )
+
+
+print(Solution().closeStrings(word1="abc", word2="bca"))
+print(Solution().closeStrings(word1="a", word2="aa"))
+print(Solution().closeStrings(word1="cabbba", word2="abbccc"))

src/hashmap_set/determine_if_two_strings_are_close/solution.py

@@ -0,0 +1,17 @@
+import pytest
+from src.hashmap_set.determine_if_two_strings_are_close.solution import (
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    "word1, word2, expected",
+    [
+        ("abc", "bca", True),
+        ("a", "aa", False),
+        ("cabbba", "abbccc", True),
+    ],
+)
+def test_close_strings(word1, word2, expected):
+    solution = Solution()
+    assert solution.closeStrings(word1, word2) == expected