You are given a string s and an integer array cost of the same length n, where cost[i] represents the cost of removing the character at index i from s.

You want to remove characters from s such that all remaining characters in the string are identical.

Return the minimum total cost needed to make all remaining characters in s equal.

Constraints:

• n $==$ s.length $==$ cost.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ cost[i] $\leq 10^9$

• 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.