Cutie String

CodeChefOpen on judge ↗

You are given a string $s$ of length $n$. You have to find the length of the longest `Cutie String`. A string is said to be `Cutie String` if: - It is a substring of string $s$. - It appears at least twice in string $s$. The substrings may overlap. Find the length of the longest Cutie String. ### Input - The first line contains the length $n$ of string $s$. - The second line contains the string.

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