LC-1657 Medium LeetCode

1657. Determine if Two Strings Are Close

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 54% Topics: Hash Table, String, Sorting, Counting

Reading material

Arrays & Hashing 12 min Strings 12 min Sorting 13 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

import collections


class Solution(object):
    def closeStrings(self, word1, word2):
        """
        :type word1: str
        :type word2: str
        :rtype: bool
        """
        if len(word1) != len(word2):
            return False 
        
        cnt1, cnt2 = collections.Counter(word1), collections.Counter(word2)   # Reuse of keys
        return set(cnt1.iterkeys()) == set(cnt2.iterkeys()) and \
               collections.Counter(cnt1.itervalues()) == collections.Counter(cnt2.itervalues())

Solution from kamyu104/LeetCode-Solutions · MIT