Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
If <code>num</code> contains a single zero digit then the answer is at most <code>n - 1</code>.
A number is divisible by <code>25</code> if its last two digits are <code>75</code>, <code>50</code>, <code>25</code>, or <code>00</code>.
Iterate over all possible pairs of indices <code>i < j</code> such that <code>num[i] * 10 + num[j]</code> is in <code>[00,25,50,75]</code>. Then, set the answer to <code> min(answer, n - i - 2) </code>.