Sparse Arrays Problem in Java | Hacker Rank Interview Preparation | One Month Preparation Kit.

This video is about Step by step explanation of Sparse Arrays problem on Hacker Rank.
---------------------------------------------------------------------------------------------------------------------
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 2 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:
⚫ string strings[n] - an array of strings to search
⚫ string queries[q] - an array of query strings
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].

#sparsearrays #hackerrank #solution
---------------------------------------------------------------------------------------------------------------------

Just visit the below website for code:-
http://bit.do/nobi
Don't' Forget to Like, Share and Subscribe for future updates...
Thank you!!!!!!!!
After copying and pasting the code, still not working
Don't Worry I'm hereby to help you
Ping me on Instagram.

?FOLLOW US ON INSTAGRAM: https://www.instagram.com/shivasai_alle/

Email:- [email protected]