Truncate Sentence — LeetCode 1816 Python Solution
- Problem
- #1816
- Pattern
- Hash Map
- Reading time
- 2 min
- Source
- leetcode.com
The problem
A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each of the words consists of only uppercase and lowercase English letters (no punctuation).
Example
- Input
- s = "Hello how are you Contestant", k = 4
- Output
- "Hello how are you"
- Explanation
- The words in s are ["Hello", "how" "are", "you", "Contestant"].
Python solution
class Solution:
def truncateSentence(self, s: str, k: int) -> str:
return ' '.join(s.split()[:k])Complexity
| Measure | Complexity |
|---|---|
| Time | O(n), where n is the length of the string s |
| Space | O(1) auxiliary |
Pattern: Hash Map
Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1816. Truncate Sentence is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.
The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 1816. Truncate Sentence?
- LeetCode 1816. Truncate Sentence is rated Easy on LeetCode.
- What is the time complexity of LeetCode 1816. Truncate Sentence?
- The Python solution on this page runs in O(n), where n is the length of the string s.
- What is the space complexity of LeetCode 1816. Truncate Sentence?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 1816. Truncate Sentence cover?
- LeetCode 1816. Truncate Sentence is tagged Array and String on LeetCode.