sparseArray.js

// 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.
// 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 , the size of .
// Each of the next  lines contains a string .
// The next line contains , the size of .
// Each of the next  lines contains a string .


// Sample Input 1


// 4
// aba
// baba
// aba
// xzxb
// 3
// aba
// xzxb
// ab


// Sample Output 1

// 2
// 1
// 0



function matchingStrings(strings, queries) {
  // Write your code here

  let [count, results] = [0, []];

  queries.forEach((query) => {
    count = 0;
    strings.forEach((singleString) => {
      if (singleString === query) {
        count += 1;
      }
    });
    results.push(count);
  });

  return results;
}
matchingStrings(["aba", "baba", "aba", "xzxb"], ["aba", "xzxb", "ab"]);