Skip to content

Practice Length of the Longest Alphabetical Continuous Substring

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2414
LeetCode Problem

Length of the Longest Alphabetical Continuous Substring

String

Problem Statement

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.

Source: Length of the Longest Alphabetical Continuous Substring on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "abacaba"
Output
2

# Example 2

Input
s = "abcde"
Output
5

Constraints

1 <= s.length <= 10^5
s consists of only English lowercase letters.

Related LeetCode Problems

Practice more problems similar to Length of the Longest Alphabetical Continuous Substring.

3 Longest Substring Without Repeating Characters Medium5 Longest Palindromic Substring Medium6 Zigzag Conversion Medium8 String to Integer (atoi) Medium10 Regular Expression Matching Hard
← Previous Smallest Even MultipleNext → Reverse Odd Levels of Binary Tree

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free