← All problemsSign in

Shubham and Valid Substrings

Recently, Shubham learnt about strings. So, He decided to give problem to his friend Gaurav about strings. He gave him a string containing only lower-case English alphabets and wants him to find the length of longest valid substring. Longest valid substring of a string is the string whose alphabets are continuous, for example, 'abcd', 'jkl', 'xyz' are all valid substrings of the string "abcdhjkle

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start