280. Sort Words by Length
Core1000 ms256 MBSolved by 0%
Sort n words by length, shortest first. Words of equal length keep the
order they had in the input.
apple be cat do -> be do cat apple
Two things are being practised here. Sorting by a computed property rather than
by the values themselves, and stability again: be and do are both two
letters, and be came first.
This is the shape of almost every real sort you will write, because real data is records sorted by one of their fields rather than bare numbers.
Constraints - `1 ≤ n ≤ 100000` - `1 ≤ word length ≤ 20` - Words contain lowercase letters only.
Input
The first line contains an integer n.
Each of the next n lines contains one word of lowercase letters.
Output
Print the words ordered by length, ties keeping input order, separated by single spaces.
Input4
apple
be
cat
do
Outputbe do cat apple
Noteis the worked example, with a tie at length two
Input1
hello
Outputhello
Noteis a single word
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.