Challenges

Bitwise for Dummies
This is to provide you with an introductory experience of bit-wise ope...
Max. Marks: 6
Solved By : 109
Double the Number
Given an array A of size N and K. count all the number of elements suc...
Max. Marks: 8
Solved By : 187
Rotate Array
You are given an array of N length. You have to rotate the array right...
Max. Marks: 6
Solved By : 1578
Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 5066
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 4187
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 2347
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 3622
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 4319
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2978
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 2235
Word Frequency
Please select a challenge
Problem Statement
You will be given a group of words. You need to print all unique words in that group in descending order of their frequency, i.e the word repeated most number of times will come first. In case of two words having the same frequency, the word listed earlier in the group will be printed first.

Input
First line contains N, the number of words. Next line contains N space-separated words.

Output
Print the words in descending order of their frequency

Constraints
1 ≤ N ≤ 20 1 ≤ word[i].length ≤ 40

Sample Input
12
can you can a can as a canner can can a can

Sample Output

can a you as canner

Dcoded By: Mrudul Sankhere

Solved By: 688

Maximum Marks: 10