Sparse Arrays | HackerRank

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.

For example, given input and, we find instances of ',  of '' and of ''. For each query, we add an element to our return array.

Function Description

Complete the function matching strings 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:

• strings - an array of strings to search
• queries - an array of query strings

Input Format

The first line contains an 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.

Output Format

Return an integer array of the results of all queries in order.

Sample Input 1

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++ 14)

#include<bits/stdc++.h>

using namespace std;

int main()

{

   int n,count=0;

   cin>>n;

   vector<string>vec;

   for(int i=0;i<n;i++)

   {

     string s;

     cin>>s;

     vec.push_back(s);

   }

   int q;

   cin>>q;

   vector<string>vecq;

   for(int i=0;i<q;i++)

   {

      string qr;

      cin>>qr;

      vecq.push_back(qr);  

   }

   for(int i=0;i<q;i++)

   {

     for(int j=0;j<n;j++)

     {

       if(vecq[i]==vec[j])

       count++;

     }

     cout<<count<<endl;

     count=0;

   }

   return 0;

}