Problem: Minimum String Length After Removing Substrings

15 min

Explore how to use stacks to iteratively remove specific substrings from a string and calculate the minimal resulting length. This lesson helps you understand substring manipulation, implementation of removal operations, and handling dynamic string updates for efficient coding interview solutions.

Statement

You are given a string, s, containing only uppercase English letters. You can perform operations on this string where, in each operation, you remove any occurrence of the substrings "AB" or "CD" from s.

Your task is to return the shortest string length after applying all possible operations.

Note: After each removal, the string joins back together, potentially creating new occurrences of "AB" or "CD" that can also be removed.

Constraints:

$1 \leq$ s.length $\leq 100$
s consists only of uppercase English letters.

Problem: Minimum String Length After Removing Substrings

15 min

Statement

Your task is to return the shortest string length after applying all possible operations.

Note: After each removal, the string joins back together, potentially creating new occurrences of "AB" or "CD" that can also be removed.

Constraints:

$1 \leq$ s.length $\leq 100$
s consists only of uppercase English letters.

Problem: Minimum String Length After Removing Substrings

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Minimum String Length After Removing Substrings

Statement

Examples

Understand the problem

Figure it out!

Try it yourself