Given a string s, return the total number of segments present in the string.

A segment is defined as a contiguous sequence of characters that are not spaces.

Constraints:

• $0 \leq$ s.length $\leq 300$

• s consists of lowercase and uppercase English letters, digits, or one of the following characters: "!@#$%^&*()_+-=',.:".

• The only space character in s is ' '.

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.