A password is deemed strong if it satisfies all of the following criteria:

• Its length is at least $6$ and at most $20$ characters.

• It contains at least one lowercase letter, at least one uppercase letter, and at least one digit.

• It does not contain three or more identical characters consecutively (e.g., "Baaabb0" is weak, but "Baaba0" is strong).

Given a string, password, determine the minimum number of steps needed to make password strong. If it is already strong, return $0$.

In a single step, you may perform exactly one of the following operations:

• Insert one character into password.

• Delete one character from password.

• Replace one character in password with a different character.

Constraints:

• $1 \leq$ password.length $\leq 50$

• password consists of letters, digits, dot '.', or exclamation mark '!'.

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.