Length of the Longest Alphabetical Continuous Substring java #strings #arraylist #javainterview

Length of the Longest Alphabetical Continuous Substring java #strings #arraylist #javainterview

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".

For example, "abc" is an alphabetical continuous string, while "acb" and "za" are not.
Given a string s consisting of lowercase letters only, return the length of the longest alphabetical continuous substring.



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.

Видео Length of the Longest Alphabetical Continuous Substring java #strings #arraylist #javainterview канала CodeVia