Question

Python 3

Write a program that reads a sequence of words and prints every word whose frequency is equal to its length. You can assume that there will always be a word that meets this condition. If more than one word have this condition, you must print first the most frequent one. If two or more words with equal frequencies meet this condition, print them from the smallest to the largest in alphabetical order.

Sample Input

lee john lee peter john lee john john

Sample Output

john lee

Answer 1

#code.py
def stringToDict(string):
    d = dict()
    for x in string.split():
        if not d.get(x):
            d[x] = 1
        else:
            d[x] += 1
    return d

def main():
    string = input("Enter sentence: ")
    d = stringToDict(string)
    lst = []
    for x in d.keys():
        if(len(x) == d[x]):
            lst.append(x)
    lst.sort()
    for x in lst:
        print(x,end=" ")
main()

$\color{red}\underline{Output:}$

Enter sentence: lee john lee peter john lee john john john lee Process finished with e xit code 0

$\color{red}Please\; upvote\;the \;solution \;if \;it \;helped.\;Thanks!$