Timer is Running

Frequencies of Limited Range Array Elements
Submissions: 18939   Accuracy:


  Difficulty: Easy   Marks: 2

Given an array A[] of N positive integers which can contain integers from 1 to N where elements can be repeated or can be absent from the array. Your task is to count frequency of all elements from 1 to N.

Note: Expected time complexity is O(n) with O(1) extra space.

First line of input contains an integer T denoting the number of test cases. For each test case, first line contains an integer N denoting the size of array. The second line contains N space-separated integers A1, A2, ..., AN denoting the elements of the array.

For each test case, output N space-separated integers denoting the frequency of each element from 1 to N.

1 ≤ T ≤ 100
1 ≤ N ≤ 106
1 <= A[i] <= 106

2 3 2 3 5
3 3 3 3

0 2 2 0 1
0 0 4 0

Testcase 1:
Counting frequencies of each array elements, we have:
1 occurring 0 times.
2 occurring 2 times.
3 occurring 2 times.
4 occurring 0 times.
5 occurring 1 time.


** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harshit Sidhwa
Author: shef5

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.