# Find The Longest Semi Repetitive Substring: Study Guide

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

## Key idea

A semi-repetitive string has at most one pair of consecutive equal digits. Slide a window and track how many adjacent-equal pairs sit inside it; shrink from the left when that count exceeds 1.

## 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).

## Common mistake

Counting any duplicate digit rather than only adjacent pairs, or resetting the window completely after the second pair.

## 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 interview copilot app.