> For the complete documentation index, see [llms.txt](https://anton-veselskyi.gitbook.io/codding-problems-solutions/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anton-veselskyi.gitbook.io/codding-problems-solutions/leetcode/easy/length-of-last-word.md).

# Length of Last Word

## [Length of Last Word](https://leetcode.com/problems/length-of-last-word)

Given a string `s` consists of some words separated by spaces, return *the length of the last word in the string. If the last word does not exist, return* `0`.

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

**Example 1:**

```
Input: s = "Hello World"
Output: 5
```

**Example 2:**

```
Input: s = " "
Output: 0
```

**Constraints:**

* `1 <= s.length <= 104`
* `s` consists of only English letters and spaces `' '`.

## Solutions

### 🐍 Python

```python
class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        return len(s.rsplit(maxsplit=1)[-1]) if len(s.strip()) else 0
```

### 🧠 Cpp

```cpp
class Solution {
public:
    int lengthOfLastWord(string s)
    {
        int counter = 0;
        auto riter = s.rbegin();
        for(; *riter == ' '; riter++);
        for(; *riter!=' ' && riter!=s.rend(); riter++, counter++);
        return counter;
    }
};
```