Skip to content

Refine docstring and simplify reverse_letters implementation #14205

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
MaximSmolskiy merged 4 commits into from
Mar 9, 2026
Merged

Refine docstring and simplify reverse_letters implementation #14205

Changes from 2 commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
0c249b9
docs: refine docstring and simplify reverse_letters implementation
Tithi234 Jan 24, 2026
c9854e0
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Jan 24, 2026
4b11822
Update reverse_letters.py
MaximSmolskiy Mar 9, 2026
776c8b8
Merge branch 'master' into patch-8
MaximSmolskiy Mar 9, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions strings/reverse_letters.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
def reverse_letters(sentence: str, length: int = 0) -> str:
"""
Reverse all words that are longer than the given length of characters in a sentence.
If unspecified, length is taken as 0
"""Reverse all words longer than a given character length in a sentence.

If ``length`` is not specified, it defaults to 0.

>>> reverse_letters("Hey wollef sroirraw", 3)
'Hey fellow warriors'
Expand All @@ -13,7 +13,7 @@ def reverse_letters(sentence: str, length: int = 0) -> str:
'racecar'
"""
return " ".join(
"".join(word[::-1]) if len(word) > length else word for word in sentence.split()
word[::-1] if len(word) > length else word for word in sentence.split()
)


Expand Down