Hello coders, today we are going to solve Word Order HackerRank Solution in Python.
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.
- 1 <= n <= 105
- The sum of the lengths of all the words do not exceed 106
- 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.
Solution – Word Order in Python
# Enter your code here. Read input from STDIN. Print output to STDOUT from collections import Counter N = int(input()) LIST =  for i in range(N): LIST.append(input().strip()) COUNT = Counter(LIST) print(len(COUNT)) print(*COUNT.values())
Disclaimer: The above Problem (Word Order) is generated by Hacker Rank but the Solution is Provided by CodingBroz. This tutorial is only for Educational and Learning Purpose.