### 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 :

```                            ```Solution in C :

In C:

#include<stdio.h>
#include<string.h>
int main()
{
char A,B;
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 {
HashMap<String,Integer> map = new HashMap<String,Integer>();
while(numstr > 0)
{
if (map.get(str)==null)
map.put(str, 1);
else
{
int num = map.get(str);
map.put(str, num+1);
}
numstr--;
}
while(numops > 0)
{
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)```
```

## Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

## Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

## Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

## Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

## Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

## Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co