Leetcode 2696. Minimum String Length After Removing Substrings

Given an uppercase string, repeatedly delete any occurrence of the substrings "AB" or "CD" (concatenation after deletions may create new occurrences) and return the minimum achievable length. The core challenge is simulating these local cancellation rules efficiently—effectively a linear-time stack-like reduction to find which characters remain.