# Index Pairs Of A String: Interview Notes

Index Pairs Of A String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return every [start, end] such that text[start..end] is in words. Put words in a set (or a trie) and, for each start, extend end while the prefix could still match.

## 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^2) with a set of words, faster with a trie.

## Common mistake

Matching only whole-word occurrences separated by spaces (the problem is about substrings) or emitting unsorted pairs.

## 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 Linkjob AI copilot.