We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Sparse Arrays
  2. Discussions

Sparse Arrays

Sort by

recency

|

380 Discussions

|

  • fvb_boas
     + 0 comments

    Javascript Solution

    function sparseArrays(strings, queries) {

	// Map the queries, for each query search for it in strings using the filter method, return the length to the return array
	return queries.map(query => strings.filter(n => n == query).length);
	
}

  • wsileti
     + 0 comments

    C# Solution

    {
        // Dictionary to store frequency of each string in the input list
        Dictionary<string, int> stringFrequency = new Dictionary<string, int>();

        // Populate the dictionary with the count of each string in the input list
        foreach (var str in strings)
        {
            if (stringFrequency.ContainsKey(str))
            {
                stringFrequency[str]++;
            }
            else
            {
                stringFrequency[str] = 1;
            }
        }

        // List to store the result for each query
        List<int> results = new List<int>();

        // Check the frequency of each query in the dictionary and add to results
        foreach (var query in queries)
        {
            if (stringFrequency.ContainsKey(query))
            {
                results.Add(stringFrequency[query]);
            }
            else
            {
                results.Add(0); // If the query is not in the dictionary, add 0
            }
        }

        return results;
    }

  • tripplen63
     + 0 comments

    TypeScript

    function matchingStrings(strings: string[], queries: string[]): number[] {
    // Write your code here
    let result = [];
    for (let i = 0; i < queries.length; i++)
    {
        let counter = 0;
        for (let j = 0; j < strings.length; j++)
        {
            if (queries[i] == strings[j])
            {
                counter++;
            }
        }
        result.push(counter);
    }
    
    return result;
}

  • amitlr7300
     + 0 comments

    C# Solution

     List<int> countArr = new List<int>();
    //distinct check not required
    //List<string> distQuery = queries.Distinct().ToList();
    var frequency = strings.GroupBy(x=>x).ToDictionary(x => x.Key, x => x.Count());
    foreach(var q in queries)
    {
        if(frequency.ContainsKey(q))
        {
        Console.WriteLine("{0} element has count of {1} ",q, frequency[q]);
        countArr.Add(frequency[q]);
        }
        else
        {
            countArr.Add(0);
        }
    }
    return countArr;

  • yashdeora98294
     + 0 comments

    Here is - HackerRank Sparse Arrays problem solution in Python Java C++ and c programming