Leetcode 1544. Make The String Great

Repeatedly remove adjacent pairs of the same letter in opposite cases (e.g., 'a' and 'A') until no such pairs remain, and return the resulting unique "good" string. This is a stack-like cancellation problem solvable by scanning and cancelling opposite-case neighbors.