# Length of Last Word Leetcode Solution

In this post, we are going to solve the Length of Last Word Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

## Problem

Given a string `s` consisting of words and spaces, return the length of the last word in the string.

word is a maximal substring consisting of non-space characters only.

Example 1:

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

Example 2:

```Input: s = "   fly me   to   the moon  "
Output: 4
Explanation: The last word is "moon" with length 4.
```

Example 3:

```Input: s = "luffy is still joyboy"
Output: 6
Explanation: The last word is "joyboy" with length 6.
```

Constraints:

• `1 <= s.length <= 104`
• `s` consists of only English letters and spaces `' '`.
• There will be at least one word in `s`.

Now, lets see the leetcode solution of Length of Last Word Leetcode Solution.

### Length of Last Word Leetcode Solution in Python

```class Solution:
def lengthOfLastWord(self, s: str) -> int:
i = len(s) - 1

while i >= 0 and s[i] == ' ':
i -= 1
lastIndex = i
while i >= 0 and s[i] != ' ':
i -= 1

return lastIndex - i
```

### Length of Last Word Leetcode Solutionin CPP

```class Solution {
public:
int lengthOfLastWord(string s) {
int i = s.length() - 1;

while (i >= 0 && s[i] == ' ')
--i;
const int lastIndex = i;
while (i >= 0 && s[i] != ' ')
--i;

return lastIndex - i;
}
};
```

### Length of Last Word Leetcode Solution in Java

```class Solution {
public int lengthOfLastWord(String s) {
int i = s.length() - 1;

while (i >= 0 && s.charAt(i) == ' ')
--i;
final int lastIndex = i;
while (i >= 0 && s.charAt(i) != ' ')
--i;

return lastIndex - i;
}
}
```

Note: This problem Length of Last Word is generated by Leetcode but the solution is provided by Chase2learn This tutorial is only for Educational and Learning purposes.

Sharing Is Caring