leetcode

424. Longest Repeating Character Replacement

Solution

n = s

Time complexity: O(n)

k = alphabet = 26

Space complexity: O(k)