# Myers Bit Parallel Distance: Study Guide

Myers Bit Parallel Distance shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Encode each DP diagonal of the Ukkonen automaton in machine words and update them with a constant number of bitwise operations per character.

## 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(ceil(m / w) n) time for pattern length m and word size w.

## Common mistake

Shifting the bitvectors in the wrong direction so insertions and deletions swap meanings and the distance is off by the pattern length.

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