Chef Notani and Repetition
CodeChefOpen on judge ↗
Chef Notani had scribbled some characters on a page which created a long, continuous string. He loved finding repetitions in strings, so he decided to find out the longest non-overlapping, repeated substring in his string. In other words, he wanted to find 2 substrings in his string, which did not overlap, and were exactly the same. Help Chef Notani solve this task and print the length of the l
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.
Sign in to chat with the tutor and save your progress.
Sign in to start