You are given n words. Some words may repeat. For each word, output its number of occurrences. The output order should correspond with the input order of appearance of the word. See the sample input/output for clarification.
Note: Each input line ends with a “\n” character.
The sum of the lengths of all the words do not exceed 10^6
All the words are composed of lowercase English letters only.
The first line contains the integer, n.
The next n lines each contain a word.
Output 2 lines.
On the first line, output the number of distinct words from the input.
On the second line, output the number of occurrences for each distinct word according to their appearance in the input.
4 bcdef abcdefg bcde bcdef
3 2 1 1
There are 3 distinct words. Here, “bcdef” appears twice in the input at the first and last positions. The other words appear once each. The order of the first appearances are “bcdef”, “abcdefg” and “bcde” which corresponds to the output.
# from collections import Counter n=int(input()) l= for i in range(n): s=input() l.append(s) ul=Counter(l) print(len(ul)) for x in ul: print(ul[x],end=" ")
Disclaimer: This problem is originally created and published by HackerRank, we only provide solutions to this problem. Hence, doesn’t guarantee the truthfulness of the problem. This is only for information purposes.