Sparse Arrays


Problem Statement :


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:
strings=['ab', 'ab', 'abc']
queries=['ab', 'abc', 'bc']

There are  instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0].


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:

   1. string strings[n] - an array of strings to search
   2. string queries[q] - an array of query strings

Returns:
     1. int[q]: an array of results for each query


Input Format:

The first line contains and integer n, the size of strings[].
Each of the next n lines contains a string strings[i].
The next line contains q, the size of queries[].
Each of the next q lines contains a string queries[i].

Constraints:
   1. 1<=n<=1000 
   2. 1<=q<=1000
   3. 1<=strings[i],queries[i]<=20.



Solution :


                        In C:

#include<stdio.h>
#include<string.h>
int main()
{
    char A[1000][20],B[20];
    int N,i,Q,ans;
    scanf("%d",&N);
    for(i=0;i<N;i++)
        scanf("%s",A[i]);
    scanf("%d",&Q);
    while(Q--)
    {
        ans=0;
        scanf("%s",B);
        for(i=0;i<N;i++)
        {
            if(strcmp(B,A[i])==0)
                ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}







In C++:

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<map>
#include<string>
using namespace std;


int main()
{
	
	int n;
	cin >> n;
	map<string, int>mp;
	while (n--)
	{
		string t;
		cin >> t;
		mp[t]++;
	}
	int a;
	cin >> a;
	while (a--)
	{
		string t;
		cin >> t;
		cout << mp[t] << endl;
	}
	return 0;
}






In Java:

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) throws IOException {
        BufferedReader c = new BufferedReader(new InputStreamReader(System.in));
        Integer numstr = Integer.parseInt(c.readLine());
        HashMap<String,Integer> map = new HashMap<String,Integer>();
        while(numstr > 0)
            {
            String str = c.readLine();
            if (map.get(str)==null)
                map.put(str, 1);
            else
              {
                int num = map.get(str);
                map.put(str, num+1);
            }  
            numstr--;
        }  
        Integer numops = Integer.parseInt(c.readLine());
        while(numops > 0)
            {
            String s = c.readLine();
            if (map.get(s) == null)
                System.out.println(0);
            else
                System.out.println(map.get(s));
            numops--;
        }
    }
}







In Python 3:

N = int(input())
numbers = list()
counts = list()
for i in range(0,N):
    numbers.append(input())
Q = int(input())
for i in range(0,Q):
    checkstring = input()
    count = 0
    for num in numbers:
        if num == checkstring:
            count = count + 1
    counts.append(count)
for count in counts:
    print(count)