Count the number of occurrences of a particular digit in a number

Given a number N and a digit D, the task is to count the occurrences of D in N.

Examples:

Input: N = 25, D = 2
Output: 1

Input: N = 100, D = 0
Output: 2

Approach: Take out the digits one by one in N and check if this digit is equal to D. If equal, then increment the count by 1. In the end, print the count.

Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to count the number of occurrences
// of a particular digit in a number
  
#include <iostream>
using namespace std;
  
// Function to count the occurrences
// of the digit D in N
long long int countOccurrances(long long int n,
                               int d)
{
    long long int count = 0;
  
    // Loop to find the digits of N
    while (n > 0) {
  
        // check if the digit is D
        count = (n % 10 == d)
                    ? count + 1
                    : count;
        n = n / 10;
    }
  
    // return the count of the
    // occurrences of D in N
    return count;
}
  
// Driver code
int main()
{
  
    int d = 2;
    long long int n = 214215421;
  
    cout << countOccurrances(n, d)
         << endl;
  
    return 0;
}

chevron_right






                        filter_none









Java














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// Java program to count the number of occurrences 


// of a particular digit in a number 


import java.util.*; 


  


class GFG 


{ 


  


// Function to count the occurrences 


// of the digit D in N 


static int countOccurrances(int n, 


                            int d) 


{ 


    int count = 0; 


  


    // Loop to find the digits of N 


    while (n > 0)  


    { 


  


        // check if the digit is D 


        count = (n % 10 == d) ?  


                    count + 1 : count; 


        n = n / 10; 


    } 


  


    // return the count of the 


    // occurrences of D in N 


    return count; 


} 


  


// Driver code 


public static void main(String args[]) 


{ 


    int d = 2; 


    int n = 214215421; 


  


    System.out.println(countOccurrances(n, d)); 


} 


} 


  


// This code is contributed by Surendra_Gangwar 



















                        chevron_right







                        filter_none









Python3














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















# Python3 program to count the  


# number of occurrences of a  


# particular digit in a number 


  


# Function to count the occurrences 


# of the digit D in N 


def countOccurrances(n, d): 


    count = 0


  


    # Loop to find the digits of N 


    while (n > 0): 


  


        # check if the digit is D 


        if(n % 10 == d): 


            count = count + 1


   


        n = n // 10


  


    # return the count of the 


    # occurrences of D in N 


    return count 


  


# Driver code 


d = 2


n = 214215421


print(countOccurrances(n, d)) 


  


# This code is contributed by Mohit Kumar 



















                        chevron_right







                        filter_none









C#














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// C# program to count the number  


// of occurrences of a particular 


// digit in a number 


using System; 


class GFG 


{ 


  


// Function to count the occurrences 


// of the digit D in N 


static int countOccurrances(int n, 


                            int d) 


{ 


    int count = 0; 


  


    // Loop to find the digits of N 


    while (n > 0)  


    { 


  


        // check if the digit is D 


        count = (n % 10 == d) ?  


                    count + 1 : count; 


        n = n / 10; 


    } 


  


    // return the count of the 


    // occurrences of D in N 


    return count; 


} 


  


// Driver code 


public static void Main() 


{ 


    int d = 2; 


    int n = 214215421; 


  


    Console.WriteLine(countOccurrances(n, d)); 


} 


} 


  


// This code is contributed by Code_Mech. 



















                        chevron_right







                        filter_none











Output:


3







Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.





    

        My Personal Notes
        arrow_drop_up
    

    

        
        

            
            
        

    


Recommended Posts:
Code_r
Check out this Author's contributed articles.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on  the "Improve Article" button below.