HackerRank-Solutions/Data Structures/Arrays/Sparse Arrays/Solution.java

//     Author: Rodney Shaghoulian
//     Github: github.com/RodneyShag
// HackerRank: hackerrank.com/RodneyShag

import java.util.Scanner;
import java.util.HashMap;

public class Solution {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int N  = scan.nextInt();
        scan.nextLine(); // gets rid of pesky newline
        
        /* Create and fill HashMap */
        HashMap<String, Integer> map  = new HashMap<>();
        for (int i = 0; i < N; i++) {
            String str = scan.nextLine();
            map.merge(str, 1, Integer::sum);
        }
       
        /* Query HashMap */
        int Q = scan.nextInt();
        scan.nextLine(); // gets rid of pesky newline
        for (int i = 0; i < Q; i++) {
            String str = scan.nextLine();
            System.out.println(map.getOrDefault(str, 0));
        }
    }
}