Leetcode 1717. Maximum Score From Removing Substrings

Given a string s and scores x and y for removing substrings "ab" and "ba", repeatedly delete those substrings to maximize total points. Because deletions can create new pairs, the core challenge is choosing an optimal removal order (commonly handled by greedy stack-based scanning that removes the higher-value pair first).