# Count Prefixes Of A Given String: Interview Notes

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

## Key idea

Count words that are prefixes of s. For each word, check s.startswith(word) (or compare the first len(word) characters).

## 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(total length).

## Common mistake

Checking whether s is a prefix of the word (reversed condition), or using a trie when n is tiny and a direct check is clearer.

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