DSA Visualizations | Hello Interview

Longest Repeating Character Replacement

DESCRIPTION (credit Leetcode.com)

Write a function to find the length of the longest substring containing the same letter in a given string s, after performing at most k operations in which you can choose any character of the string and change it to any other uppercase English letter.

EXAMPLES

Input:


s = "BBABCCDD"
k = 2

Output:

Explanation: Replace the first 'A' and 'C' with 'B' to form "BBBBBCCDD". The longest substring with identical letters is "BBBBB", which has a length of 5.

Run your code to see results here

Explanation

In order for a substring to be valid, k + the frequency of the most frequent character in the substring must be greater than or equal to the length of the substring.

For example, if k = 2, and the substring is AABBB, then the most frequent character is B, which shows up 3 times. The substring is valid because 2 + 3 >= 5.

However, if k = 2 and the substring is AAABBB, then the substring is invalid because 2 + 3 < 6.

We use this fact to solve this problem with a variable-length sliding window to iterate over all valid substrings, and return the longest of those lengths at the end. To represent the state of the current window, we keep track of two variables:

state: A dictionary mapping each character to the number of times it appears in the current window.
max_freq: The maximum number of times a single character has appeared in any window so far.

We start by extending the current window until it becomes invalid (i.e. k + max_freq < window length).


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

start

longest repeating character replacement

0 / 12

At this point, the longest substring we have found so far is BCBAB, which has a length of 5 (max_freq = 3 + k = 2).

Now, whenever we try to extend the current window to length 6, it will be invalid unless the character we just included in the window shows up 4 times. So each time we increase the window to length 6, we immediately shrink the window to length 5 until we find a character which shows up 4 times.


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

max_count: 3

start: 0 | end: 5

expand window

0 / 9

This continues until we reach the end of the string, at which point we return the length of the longest substring we have found so far.


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

max_count: 4

start: 3 | end: 8

expand window

0 / 5

Solution


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

start

longest repeating character replacement

0 / 26

Next: Overview

Your account is free and you can post anonymously if you choose.

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Longest Substring Without Repeating Characters

Overview

Longest Repeating Character Replacement

DESCRIPTION (credit Leetcode.com)

EXAMPLES

Input:


s = "BBABCCDD"
k = 2

Output:

Explanation: Replace the first 'A' and 'C' with 'B' to form "BBBBBCCDD". The longest substring with identical letters is "BBBBB", which has a length of 5.

Run your code to see results here

Explanation

In order for a substring to be valid, k + the frequency of the most frequent character in the substring must be greater than or equal to the length of the substring.

For example, if k = 2, and the substring is AABBB, then the most frequent character is B, which shows up 3 times. The substring is valid because 2 + 3 >= 5.

However, if k = 2 and the substring is AAABBB, then the substring is invalid because 2 + 3 < 6.

state: A dictionary mapping each character to the number of times it appears in the current window.
max_freq: The maximum number of times a single character has appeared in any window so far.

We start by extending the current window until it becomes invalid (i.e. k + max_freq < window length).


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

start

longest repeating character replacement

0 / 12

At this point, the longest substring we have found so far is BCBAB, which has a length of 5 (max_freq = 3 + k = 2).


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

max_count: 3

start: 0 | end: 5

expand window

0 / 9

This continues until we reach the end of the string, at which point we return the length of the longest substring we have found so far.


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

max_count: 4

start: 3 | end: 8

expand window

0 / 5

Solution


def characterReplacement(s, k):
  state = {}
  max_freq = 0
  max_length = 0
  start = 0

  for end in range(len(s)):
    state[s[end]] = state.get(s[end], 0) + 1
    max_freq = max(max_freq, state[s[end]])

    if k + max_freq < end - start + 1:
      state[s[start]] -= 1
      start += 1

    max_length = max(max_length, end - start + 1)

  return max_length

start

longest repeating character replacement

0 / 26

Next: Overview

Your account is free and you can post anonymously if you choose.

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103