Sort by

recency

|

2446 Discussions

|

  • + 0 comments

    Here is Sparse Arrays solution in Python, java, c++ and c programming - https://programmingoneonone.com/hackerrank-sparse-arrays-problem-solution.html

  • + 0 comments

    Mi solución en Python 3:

    def matchingStrings(stringList, queries):
        # Write your code here
        resultados = []
        for i in queries:
            contador = 0
            for j in stringList:
                if i == j:
                    contador += 1
            resultados.append(contador)
        return(resultados)
    
  • + 0 comments
    function matchingStrings(stringList, queries) {
        
        let results = [];
        for (let i = 0; i < queries.length; i++) {
            let count = 0;
            stringList.forEach((str) => {
                if (queries[i] === str) {
                    count++;
                }
            })
            results.push(count);
        }
        return results;
    }
    
  • + 0 comments
    def matchingStrings(stringList, queries):
        # Write your code here
        counts = Counter(stringList)
        results = []
        for query in queries:
            results.append(counts[query])
        return results
    
  • + 1 comment

    Java (O(n+m):

    public static List<Integer> matchingStrings(List<String> stringList, List<String> queries) {
        List<Integer>matches = new ArrayList<>();
        Map<String, Integer> helper = new HashMap<>();
        for(String s : stringList){
            helper.put(s, helper.getOrDefault(s, 0)+1);
        }
        for(String q : queries){
            matches.add(helper.getOrDefault(q, 0));
        }
        return matches;
    
        }