Practice Subdomain Visit Count

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#811

LeetCode Problem

Subdomain Visit Count

Array Hash Table String Counting

Problem Statement

A website domain "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com" and at the lowest level, "discuss.leetcode.com". When we visit a domain like "discuss.leetcode.com", we will also visit the parent domains "leetcode.com" and "com" implicitly. A count-paired domain is a domain that has one of the two formats "rep d1.d2.d3" or "rep d1.d2" where rep is the number of visits to the domain and d1.d2.d3 is the domain itself. Given an array of count-paired domains cpdomains, return an array of the count-paired domains of each subdomain in the input. You may return the answer in any order.

Source: Subdomain Visit Count on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

cpdomains = ["9001 discuss.leetcode.com"]

Output

["9001 leetcode.com","9001 discuss.leetcode.com","9001 com"]

# Example 2

Input

cpdomains = ["900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"]

Output

["901 mail.com","50 yahoo.com","900 google.mail.com","5 wiki.org","5 org","1 intel.mail.com","951 com"]

Constraints

1 <= cpdomain.length <= 100

1 <= cpdomain[i].length <= 100

cpdomain[i] follows either the "repi d1i.d2i.d3i" format or the "repi d1i.d2i" format.

repi is an integer in the range [1, 10^4].

d1i, d2i, and d3i consist of lowercase English letters.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free