# Karatsuba Divide Multiply: Practice Notes

Karatsuba Divide Multiply shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Split each n-bit integer into high and low halves and replace one of the four half-size products by a linear combination so only three recursive multiplications are needed.

## 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^{log_2 3}) ~ O(n^{1.585}).

## Common mistake

Computing the middle product as ac + bd instead of (a+b)(c+d) - ac - bd, which uses four multiplications and loses the speedup.

## 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 assistant for technical interviews.