You are given a string s and two integers x and y. You can perform two types of operations any number of times:

1. Remove any occurrence of the substring "ab" and gain x points.

2. Remove any occurrence of the substring "ba" and gain y points.

Return the maximum total points you can obtain after applying any number of these operations.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• $1 \leq$ x, y $\leq 10^4$

• s consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.