HackerRank Sparse Arrays solution in C/C++

 Sparse Arrays 

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results.

Example

There are  instances of ',  of '' and  of ''. For each query, add an element to the return array, .

Function Description

Complete the function matchingStrings in the editor below. The function must return an array of integers representing the frequency of occurrence of each query string in strings.

matchingStrings has the following parameters:

• string strings[n] - an array of strings to search
• string queries[q] - an array of query strings

Returns

• int[q]: an array of results for each query

Input Format

The first line contains and integer , the size of .
Each of the next  lines contains a string .
The next line contains , the size of .
Each of the next  lines contains a string .

Constraints

 .

Sample Input 1

CopyDownload

4
aba
baba
aba
xzxb
3
aba
xzxb
ab

Sample Output 1

2
1
0

Explanation 1

Here, "aba" occurs twice, in the first and third string. The string "xzxb" occurs once in the fourth string, and "ab" does not occur at all.

Sample Input 2

CopyDownload

3
def
de
fgh
3
de
lmn
fgh

Sample Output 2

1
0
1

Sample Input 3

CopyDownload

13
abcde
sdaklfj
asdjf
na
basdn
sdaklfj
asdjf
na
asdjf
na
basdn
sdaklfj
asdjf
5
abcde
sdaklfj
asdjf
na
basdn

Sample Output 3

1
3
4
3
2

 Solution: C/C++ code

#include<stdio.h>

#include<string.h>

int main()

{

int siz,i;

printf("Enter size of string\n");

scanf("%d",&siz);

char str[siz][20];

for(i=0;i<siz;i++)

{

scanf("%s",str[i]);

}

int siz2;

printf("Enter size of query\n");

scanf("%d",&siz2);

char qr[siz2][20];

for(i=0;i<siz2;i++)

{

scanf("%s",qr[i]);

}

int j,z=NULL,k=0,count=-1;

int ans[siz2];

for(i=0;i<siz2;i++)

{

for(j=0;j<siz;j++)

{

count = strcmp(qr[i],str[j]);

if(count == 0)

{

z=z+1;

count =-1;

}

}

printf("%d\n",z);

z=NULL;

}

k++;

}