v0.40: Create exercises. Challenge the community.

sort_ranked_words

Your mission

Implement sort_ranked_words, a stable sorter for a list of strings.

See it in action

sort_ranked_words(["pear", "fig", "kiwi", "plum"])

Expected result

["fig", "kiwi", "pear", "plum"]

Your checklist

For your own tracking. Tests grade your code.

Create ranked_words.py.
Expose def sort_ranked_words(words: list[str]) -> list[str]:.
Return a new list sorted by string length first, shortest to longest.
When lengths are equal, compare strings using lowercase text.
When length and lowercase text are equal, compare by the number of vowels in the original string, ascending.
If all sorting keys are equal, keep the original relative order.

More examples

sort_ranked_words(["Bee", "ant", "bee", "Ant"])

Expected result

["ant", "Ant", "Bee", "bee"]

Constraints

Expected files

ranked_words.py

Allowed functions

None. Write every helper yourself.

sort_ranked_words

Your mission

Implement sort_ranked_words, a stable sorter for a list of strings.

See it in action

sort_ranked_words(["pear", "fig", "kiwi", "plum"])

Expected result

["fig", "kiwi", "pear", "plum"]

Your checklist

For your own tracking. Tests grade your code.

Create ranked_words.py.
Expose def sort_ranked_words(words: list[str]) -> list[str]:.
Return a new list sorted by string length first, shortest to longest.
When lengths are equal, compare strings using lowercase text.
When length and lowercase text are equal, compare by the number of vowels in the original string, ascending.
If all sorting keys are equal, keep the original relative order.

More examples

sort_ranked_words(["Bee", "ant", "bee", "Ant"])

Expected result

["ant", "Ant", "Bee", "bee"]

Constraints

Expected files

ranked_words.py

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Length then case-insensitive textWaiting

02Case-insensitive ordering keeps ties stableWaiting

03Empty string sorts firstWaiting

04Punctuation remains part of the lexical keyWaiting

05Empty listWaiting

06Vowel count and stable tiesWaiting

sort_ranked_words

Your mission

Implement sort_ranked_words, a stable sorter for a list of strings.

See it in action

sort_ranked_words(["pear", "fig", "kiwi", "plum"])

Expected result

["fig", "kiwi", "pear", "plum"]

Your checklist

For your own tracking. Tests grade your code.

Create ranked_words.py.
Expose def sort_ranked_words(words: list[str]) -> list[str]:.
Return a new list sorted by string length first, shortest to longest.
When lengths are equal, compare strings using lowercase text.
When length and lowercase text are equal, compare by the number of vowels in the original string, ascending.
If all sorting keys are equal, keep the original relative order.

More examples

sort_ranked_words(["Bee", "ant", "bee", "Ant"])

Expected result

["ant", "Ant", "Bee", "bee"]

Constraints

Expected files

ranked_words.py

Allowed functions

None. Write every helper yourself.

v0.40: Create exercises. Challenge the community.

Meet Studio →

sort_ranked_words

Your mission

Implement sort_ranked_words, a stable sorter for a list of strings.

See it in action

sort_ranked_words(["pear", "fig", "kiwi", "plum"])

Expected result

["fig", "kiwi", "pear", "plum"]

Your checklist

For your own tracking. Tests grade your code.

Create ranked_words.py.
Expose def sort_ranked_words(words: list[str]) -> list[str]:.
Return a new list sorted by string length first, shortest to longest.
When lengths are equal, compare strings using lowercase text.
When length and lowercase text are equal, compare by the number of vowels in the original string, ascending.
If all sorting keys are equal, keep the original relative order.

More examples

sort_ranked_words(["Bee", "ant", "bee", "Ant"])

Expected result

["ant", "Ant", "Bee", "bee"]

Constraints

Expected files

ranked_words.py

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Length then case-insensitive textWaiting

02Case-insensitive ordering keeps ties stableWaiting

03Empty string sorts firstWaiting

04Punctuation remains part of the lexical keyWaiting

05Empty listWaiting

06Vowel count and stable tiesWaiting