LC-0438 Medium LeetCode

438. Find All Anagrams in a String

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 52% Topics: Hash Table, String, Sliding Window

Reading material

Arrays & Hashing 12 min Strings 12 min Sliding Window 11 min

Reference solution (spoiler · python)

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

class Solution(object):
    def findAnagrams(self, s, p):
        """
        :type s: str
        :type p: str
        :rtype: List[int]
        """
        result = []

        cnts = [0] * 26
        for c in p:
            cnts[ord(c) - ord('a')] += 1

        left, right = 0, 0
        while right < len(s):
            cnts[ord(s[right]) - ord('a')] -= 1
            while left <= right and cnts[ord(s[right]) - ord('a')] < 0:
                cnts[ord(s[left]) - ord('a')] += 1
                left += 1
            if right - left + 1 == len(p):
                result.append(left)
            right += 1

        return result

Solution from kamyu104/LeetCode-Solutions · MIT