# Long Pressed Name: Explained

Long Pressed Name shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

typed is a long-pressed version of name if you can group equal-letter runs and every run in typed is at least as long as the corresponding run in name, in the same order. Two pointers over runs (or characters, allowing typed to stay while name advances only on a 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+m).

## Common mistake

Using a multiset of characters (order matters) or requiring the runs to be exactly equal.

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