Digit Frequency | hackerrank practice problem solution

   Problem:-

Given a string, , consisting of alphabets and digits, find the frequency of each digit in the given string.

Input Format

The first line contains a string,  which is the given number.

Constraints


All the elements of num are made of english alphabets and digits.

Output Format

Print ten space-separated integers in a single line denoting the frequency of each digit from  to .

Sample Input 0

a11472o5t6

Sample Output 0

0 2 1 0 1 1 1 1 0 0 

Explanation 0

In the given string:

  •  occurs two times.
  •  and  occur one time each.
  • The remaining digits  and  don’t occur at all.

Sample Input 1

lw4n88j12n1

Sample Output 1

0 2 1 0 1 0 0 0 2 0 

Sample Input 2

1v88886l256338ar0ekk

Sample Output 2

1 1 1 2 0 1 2 0 5 0 

Solution:-

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

char s[1000];
int a[10],x;
scanf(“%s”,s);
for(int i=0;i<10;i++)
a[i]=0;
for(int i=0;s[i];i++)
{
x=s[i];
if(x>=48&&x<=57)
{
a[x48]++;
}
}
for(int i=0;i<=9;i++)
printf(“%d “,a[i]);
return 0;
}

Recommended post:-

Hackerearth Problems:-

Hackerrank Problems:-

Data structure:-

Key points:-


Leave a Reply

Your email address will not be published.