# Suffix Automaton Endpos Occurrence: Practice Notes

Suffix Automaton Endpos Occurrence shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build the SAM and use endpos-set sizes (cloned nodes split sets) so each substring occurrence count is the size of its endpos set.

## 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) to build, O(1) per distinct substring after precomputing set sizes.

## Common mistake

Forgetting to add the clone node size into the original node, which undercounts occurrences of shorter clones.

## 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 AI help for online coding assessments.