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. Practice
  2. Data Structures
  3. Arrays
  4. Sparse Arrays
  5. Discussions

Sparse Arrays

  • nielgp93 + 0 comments

    Mine in C++ using solution involving sorting, lower_bound, and upper_bound

    std::vector<int> matchingStrings(
    std::vector<std::string> strings,
    const std::vector<std::string>& queries)
{
    std::sort(strings.begin(), strings.end());
    std::vector<int> result;
    result.reserve(queries.size());
    for (const auto& query : queries)
    {
        auto lower = std::lower_bound(strings.begin(), strings.end(), query);
        auto upper = std::upper_bound(strings.begin(), strings.end(), query);
        int diff = (lower == strings.end()) ? 0 : std::distance(lower, upper);
        result.push_back(diff);
    }
    return result;
}