EasyNo. 0058

Length of Last Word — LeetCode 58 Python Solution

Pattern
Hash Map
Topics
String
On a study list
Top Interview 150
Reading time
2 min

The problem

Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only.

Example

Input
s = "Hello World"
Output
5
Explanation
The last word is "World" with length 5.

Python solution

PythonSolution
class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        i = len(s) - 1
        while i >= 0 and s[i] == ' ':
            i -= 1
        j = i
        while j >= 0 and s[j] != ' ':
            j -= 1
        return i - j

Complexity

Time
O(n)where n is the length of the string s
Space · auxiliary
O(1)

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 58. Length of Last Word 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

Related problems
No.ProblemDifficulty
0065Valid NumberHard
0068Text JustificationHard
0006Zigzag ConversionMedium
0008String to Integer (atoi)Medium
0038Count and SayMedium
0214Shortest PalindromeHard

Frequently asked questions

How hard is LeetCode 58. Length of Last Word?

LeetCode 58. Length of Last Word is rated Easy on LeetCode.

What is the time complexity of LeetCode 58. Length of Last Word?

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 58. Length of Last Word?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 58. Length of Last Word cover?

LeetCode 58. Length of Last Word is tagged String on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.