CountZeros.java

// Count Zeros
// Send Feedback
// Given an integer N, count and return the number of zeros that are present in the given integer using recursion.
// Input Format :
// Integer N
// Output Format :
// 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

import java.util.Scanner;

public class CountZeros {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println("Enter Number : ");
        int input = s.nextInt();
        int ans = countZeroesRec(input);
        System.out.print("Output : " + ans);
        s.close();
    }

    public static int countZeroesRec(int input)
    {
        int count = 0;
        if(input == 0)
        {
            return 1;
        }
        else if(input < 10)
        {
            return 0;
        }
        int digit = input%10;
        if(digit==0)
        {
            count++;
        }

        return count + countZeroesRec(input/10);
    }
}