# Freivalds Matrix Product: Explained

Freivalds Matrix Product shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Check AB = C by multiplying both sides by a random vector r and comparing A(Br) with Cr, which detects an error with probability at least 1/2 per trial.

## 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^2) time per trial instead of O(n^omega) to recompute the product.

## Common mistake

Using a deterministic all-ones vector, which misses many structured errors that sum to zero.

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