Given a string s made up of English letters and space characters, return the length of the last word in s. A word is a maximal contiguous sequence of English letters. Trailing spaces in s should not be considered part of the last word.

Note: s is guaranteed to contain at least one word.

Constraints:

• $1 \leq$ s.length $\leq 10^4$

• s consists of only English letters and spaces ' '

• There will be at least one word in s

Input: s = "Hello World"-str
Output: 5-int
Explanation: The last word is "World", which has 5 letters.

Input: s = " fly me to the moon "-str
Output: 4-int
Explanation: Trailing spaces are ignored, and the last word is "moon" with length 4.

Input: s = "luffy is still joyboy"-str
Output: 6-int
Explanation: The last word is "joyboy", which has 6 letters.

Input: s = "a"-str
Output: 1-int
Explanation: The string contains a single word "a", so the last word length is 1.

Input: s = "day "-str
Output: 3-int
Explanation: Trailing spaces are not part of the last word, so the last word is "day" with length 3.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.