# 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.

AÂ 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, letâ€™s 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