Given a string word consisting of lowercase English letters, determine whether it is possible to remove exactly $1$ character from word such that the frequency of every remaining distinct character in the string is equal.

Return true if this is possible, and false otherwise.

Note: The frequency of a character is the count of its occurrences in the string. After removing $1$ character, characters with a frequency of $0$ are ignored when checking if all remaining characters have equal frequencies.

Constraints:

• $2 \leq$ word.length $\leq 100$

• word consists of lowercase English letters only.

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.