Given a string s consisting of lowercase English letters, determine the maximum difference between the frequency of a character that appears an odd number of times and the frequency of a character that appears an even number of times.

Specifically, calculate the maximum value of $( ext{frequency of character } a) - ( ext{frequency of character } b)$, where character $a$ has an odd frequency and character $b$ has an even frequency in s.

Constraints:

• $3 \leq$ s.length $\leq 100$

• s consists only of lowercase English letters.

• s contains at least one character with an odd frequency and at least one character with an even frequency.

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.