Minimum String Length After Removing Substrings

Try to solve the Minimum String Length After Removing Substrings problem.

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:

  • 1≤1 \leq s.length ≤100\leq 100

  • s consists only of uppercase English letters.

Examples

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.