# Longest Duplicate Substring: Walkthrough

Longest Duplicate Substring shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Binary-search the length L and use Rabin-Karp rolling hashes (with a collision check) to test whether any substring of length L appears twice. Return one such substring of the maximum L, or empty.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n) expected with hashing.

## Common mistake

Building a suffix array from scratch without binary search on L, or using an un-checked hash that can collide into a wrong answer.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at the Linkjob AI app.