Thursday, August 1, 2019

Word Order - Hacker Rank Solution

You are given  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.
Constraints:

The sum of the lengths of all the words do not exceed 
All the words are composed of lowercase English letters only.
Input Format
The first line contains the integer, .
The next  lines each contain a word.
Output Format
Output  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.
Sample Input
4
bcdef
abcdefg
bcde
bcdef
Sample Output
3
2 1 1
Explanation
There are  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.

Word Order - Hacker Rank Solution

WORKING ON IT PLEASE. DROP YOUR ANSWER IF U WAS DONE

2 comments:

  1. from collections import OrderedDict
    d = OrderedDict()
    n = int(input())
    for i in range(n):
    name = input()
    if name in d.keys():
    d[name] += 1
    else:
    d[name] = 1

    print(len(d.keys()))
    for x,y in d.items():
    print(y, end = ' ')

    ReplyDelete
  2. n = int(input())
    word = []
    count = []

    for i in range(n):
    w = input()
    if w not in word:
    word.append(w)
    count.append(1)
    else:
    j = word.index(w)
    count[j] = count[j] + 1

    print(len(count))
    for i in count:
    print(i, end = " ")

    ReplyDelete

Powered by Blogger.