Skip to content

Rebun13/SparseArrays

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

SparseArrays

Description

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.

Returns

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].

About

Training project from HackerRank.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages