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 :
Solution in C :
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)
View More Similar Problems
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
View Solution →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
View Solution →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
View Solution →No Prefix Set
There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio
View Solution →Cube Summation
You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor
View Solution →Direct Connections
Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do
View Solution →