You are given a string num representing a non negative integer.

In one operation, you can pick any digit in num and delete it. If you delete all digits from num, the resulting value is considered to be $0$.

An integer is considered special if it is divisible by $25$.

Return the minimum number of operations required to make num special.

Constraints:

• $1 \leq$ num.length $\leq 100$

• num consists only of digits $'0'$ through $'9'$.

• num does not contain any leading zeros.

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.