Boring String

CodeChefRating 1566Open on judge ↗

A string is called *boring* if all the characters of the string are **same**. You are given a string $S$ of length $N$, consisting of lowercase english alphabets. Find the length of the longest *boring* substring of $S$ which occurs **more than once**. Note that if there is no *boring* substring which occurs more than once in $S$, the answer will be $0$. A substring is obtained by deleting some

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