...
/Solution: Minimum String Length After Removing Substrings
Solution: Minimum String Length After Removing Substrings
Let’s solve the Minimum String Length After Removing Substrings problem using the Stacks pattern.
We'll cover the following...
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:
...
Access this course and 1400+ top-rated courses and projects.