Problem
Submissions
Hints & solutions
Discuss
Count Zeros
Easy
0/40
4 upvotes
Problem statement
Given an integer N, count and return the number of zeros that are present in the given integer using recursion.
Detailed explanation ( Input/output format, Notes, Images )
Input Format :
Integer N
Number of zeros in N
Constraints :
0 <= N <= 10^9
Sample Input 1 :
0
Sample Output 1 :
1
Sample Input 2 :
00010204
Sample Output 2 :
2
Explanation for Sample Output 2 :
Even though "00010204" has 5 zeros, the output would still be 2 because when you convert it to an integer, it becomes 10204.
Sample Input 3 :
708000
Sample Output 3 :
4
C++ (g++ 5.4)
Console