LC-0424 Medium LeetCode

424. Longest Repeating Character Replacement

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 57% 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)

import collections


class Solution(object):
    def characterReplacement(self, s, k):
        """
        :type s: str
        :type k: int
        :rtype: int
        """
        result, max_count = 0, 0
        count = collections.Counter()
        for i in xrange(len(s)):
            count[s[i]] += 1
            max_count = max(max_count, count[s[i]])
            if result - max_count >= k:
                count[s[i-result]] -= 1
            else:
                result += 1
        return result

Solution from kamyu104/LeetCode-Solutions · MIT