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

|

395 Discussions

|

  • stephanie_viver2
     + 0 comments
    function matchingStrings(strings: string[], queries: string[]): number[] {
    return queries.map((q: string): number => strings.filter((s: string) => q === s).length)
}

  • ranechabria
     + 0 comments

    Scala

        def matchingStrings(strings: Array[String], queries: Array[String]): Array[Int] = {
            queries.map(q => strings.count(_ == q))
    }

  • ashutoshpatel_in
     + 0 comments
    #For Python

def matchingStrings(strings, queries):
    result = [0] * len(queries)
    for i in range(len(queries)):
        query = queries[i]
        for j in range(len(strings)):
            if query == strings[j]:
                result[i] += 1
    return result

  • ifuture2001
     + 0 comments

    Code in Go, Please suggest if any optimization can be done.

    func matchingStrings(strings []string, queries []string) []int32 { // Write your code here var count int32=0 var stringCount[] int32 for _,query:=range queries{ for _,match:=range strings{ if(query == match){ count = count + 1 } } stringCount = append(stringCount,count) count = 0 }

    return stringCount }

  • nathanfantazio
     + 0 comments

    My C# solution

     public static List<int> matchingStrings(List<string> strings, List<string> queries)
    {
        return queries.Select(q => 
            strings.Count(s => s == q))
            .ToList<int>();
    }