hackerrank/Data Structures/Arrays/Sparse Arrays

https://www.hackerrank.com/challenges/sparse-arrays/problem?h_r=next-challenge&h_v=zen 

 

#!/bin/python3
 
import math
import os
import random
import re
import sys
 
def matchingStrings(strings, queries):
    s_dict = {}
    ans = []
    
    for s in strings:
        if s_dict.get(s):
            s_dict[s] = s_dict[s] + 1
        else:
            s_dict[s] = 1
    for q in queries:
        ans.append(s_dict.get(q, 0))
    return ans
        
 
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')
 
    strings_count = int(input().strip())
 
    strings = []
 
    for _ in range(strings_count):
        strings_item = input()
        strings.append(strings_item)
 
    queries_count = int(input().strip())
 
    queries = []
 
    for _ in range(queries_count):
        queries_item = input()
        queries.append(queries_item)
 
    res = matchingStrings(strings, queries)
 
    fptr.write('\n'.join(map(str, res)))
    fptr.write('\n')
 
    fptr.close()