Length of the Longest Alphabetical Continuous Substring - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
2414. Length of the Longest Alphabetical Continuous Substring
Medium
30 Points
String
An alphabetical continuous string is a string consisting of consecutive letters in the alphabet. In other words, it is any substring of the string "abcdefghijklmnopqrstuvwxyz".
Given a string s consisting of lowercase letters only, return the length of the longest alphabetical continuous substring.
Examples
Example 1
Input: s = "abacaba"
Output: 2
Explanation: There are 4 distinct continuous substrings: "a", "b", "c" and "ab".
"ab" is the longest continuous substring.
Example 2
Input: s = "abcde"
Output: 5
Explanation: "abcde" is the longest continuous substring.
Constraints
1 <= s.length <= 105
s consists of only English lowercase letters.
2414. Length of the Longest Alphabetical Continuous Substring
Medium
30 Points
String
An alphabetical continuous string is a string consisting of consecutive letters in the alphabet. In other words, it is any substring of the string "abcdefghijklmnopqrstuvwxyz".
Given a string s consisting of lowercase letters only, return the length of the longest alphabetical continuous substring.
Examples
Example 1
Input: s = "abacaba"
Output: 2
Explanation: There are 4 distinct continuous substrings: "a", "b", "c" and "ab".
"ab" is the longest continuous substring.
Example 2
Input: s = "abcde"
Output: 5
Explanation: "abcde" is the longest continuous substring.