# Charikar SimHash Random: Practice Notes
Charikar SimHash Random shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Hash a vector by the signs of random hyperplane inner products so Hamming distance between hashes estimates cosine distance.
## 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(k) time for a k-bit sketch; collision probability is (pi - theta)/pi.
## Common mistake
Using the absolute inner product rather than its sign, which no longer yields the angle estimator.
## 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.