A sentence is a sequence of tokens separated by single spaces, containing no leading or trailing spaces. Each token is either a word consisting of lowercase English letters or a positive integer consisting of digits from $0$ to $9$ without leading zeros.

Given a string s representing a sentence, determine whether all the integers in s appear in strictly increasing order from left to right (meaning every integer is strictly greater than the integer preceding it).

Return true if all integers in s are strictly increasing, or false otherwise.

Constraints:

• $3 \leq$ s.length $\leq 200$

• s consists of lowercase English letters, spaces, and digits from $0$ to $9$, inclusive.

• The number of tokens in s is between $2$ and $100$, inclusive.

• The tokens in s are separated by a single space.

• There are at least $2$ numbers in s.

• Each number in s is a positive number less than $100$, with no leading zeros.

• s contains no leading or trailing spaces.

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.