digit using recursion Java

Hello majid Ali,

To try below codes thats partially reach your solution. then click on referece you will get what you need.

import java.util.Scanner;
public class Count_Occurrence
{
public static void main(String[] args)
{
int n, x, count = 0, i = 0;
Scanner s = new Scanner(System.in);
System.out.print("Enter no. of elements:");
n = s.nextInt();
int a[] = new int[n];
System.out.println("Enter the elements:");
for(i = 0; i < n; i++)
{
a[i] = s.nextInt();
}
System.out.print("Enter the element of which you want to count occurrences:");
x = s.nextInt();
for(i = 0; i < n; i++)
{
if(a[i] == x)
{
count++;
}
}
System.out.println("Number of Occurrence:"+count);
}
}

Reference

https://www.sanfoundry.com/java-program-count-number-occurrence-array-elements/
https://www.geeksforgeeks.org/count-occurrences-of-a-substring-recursively/

1 Reply

Know the answer? Post it — somebody with the same question will find it here.

Elavarasan R7y ago
Hello majid Ali,

To try below codes thats partially reach your solution. then click on referece you will get what you need.
import java.util.Scanner;
public class Count_Occurrence
{
    public static void main(String[] args)
    {
        int n, x, count = 0, i = 0;
        Scanner s = new Scanner(System.in);
        System.out.print("Enter no. of elements:");
        n = s.nextInt();
        int a[] = new int[n];
        System.out.println("Enter the elements:");
        for(i = 0; i < n; i++)
        {
            a[i] = s.nextInt();
        }
        System.out.print("Enter the element of which you want to count occurrences:");
        x = s.nextInt();
        for(i = 0; i < n; i++)
        {
            if(a[i] == x)
            {
                count++;
            }
        }
        System.out.println("Number of Occurrence:"+count);
    }
}
Reference
https://www.sanfoundry.com/java-program-count-number-occurrence-array-elements/
https://www.geeksforgeeks.org/count-occurrences-of-a-substring-recursively/
+2