Repetitions

CodeChefOpen on judge ↗

You are given a password sequence: a string consisting of characters A, C, G, and T. Your task is to find the longest repetition in the sequence. This is a maximum-length substring containing only one type of character . ###Input: - The only input line contains a string of n characters. ###Output: Print one integer: the length of the longest repetition. ###Constraints - $2 \leq n \

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