# Check If Numbers Are Ascending In A Sentence: Study Guide
Check If Numbers Are Ascending In A Sentence shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Tokens that are unsigned integers must appear in strictly increasing order. Scan tokens, parse those that are all digits, and compare to the last number seen.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Treating leading-zero tokens specially (they are still numbers) or using non-strict inequality.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.