# Find And Replace Pattern: Practice Notes

Find And Replace Pattern shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A word matches a pattern if there is a bijection from pattern letters to word letters. For each word, build two maps (pattern->word and word->pattern) while scanning; reject on any conflict. Normalizing both strings to a first-seen-id sequence and comparing also works.

## 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(W * L).

## Common mistake

Using only one direction of the map, which allows two pattern letters to collapse onto the same word letter.

## 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 real-time interview help.