CodingHardcod-g608

Subject Rolling hashLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a string s, find the length of the longest substring that occurs at least twice in s (occurrences may overlap). Return 0 if no character repeats. 1 <= len(s) <= 30000, lowercase letters. Aim for better than O(n^2) substring enumeration.

Implement

longest_repeated_substring_len(s: str) → int

Examples

in["banana"]out3

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.