An alphabetical continuous substring is a substring consisting of consecutive letters of the English alphabet appearing in alphabetical order. For example, "abc" is alphabetical continuous, whereas "acb" and "za" are not.

Given a string s consisting of lowercase English letters, return the length of the longest alphabetical continuous substring.

Constraints:

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

• s consists of only English lowercase letters.

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.