Given a number, return the number of closed 'circles' in the base 10 numerical representation.
Note: the number 4 has no circles
Example:
8819 -> 5
Interpolating on a string (the ASCII values) is an interesting idea even though the long interpolation string could be reduced by subtracting '0', but at the expense of a "longer" solution.
Find all elements less than 0 or greater than 10 and replace them with NaN
10980 Solvers
1755 Solvers
Test if a Number is a Palindrome without using any String Operations
145 Solvers
275 Solvers
277 Solvers