LeetCode 2696: Minimum String Length After Removing Substrings

Explanation:

To solve this problem, we can iterate through the string and remove occurrences of the substrings "AB" and "CD" one by one. We repeat this process until no more occurrences of these substrings can be removed. Finally, we return the length of the resulting string.

Algorithm:

1. Initialize a boolean variable changed to true.
2. While changed is true, set changed to false.
3. Iterate through the string and if "AB" or "CD" is found, remove the substring and set changed to true.
4. Return the length of the final string.

Time Complexity: O(n^2) where n is the length of the input string. Space Complexity: O(n) for storing the modified string.

:

class Solution {
    public int minimumLength(String s) {
        boolean changed = true;
        while (changed) {
            changed = false;
            if (s.contains("AB")) {
                s = s.replace("AB", "");
                changed = true;
            }
            if (s.contains("CD")) {
                s = s.replace("CD", "");
                changed = true;
            }
        }
        return s.length();
    }
}