# Satisfiability Of Equality Equations: Walkthrough
Satisfiability Of Equality Equations shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Union-Find every a==b first, then scan a!=b equations and reject any pair that already shares a parent.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Processing inequalities first, which has nothing to union yet and accepts contradictions that appear later.
## 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 https://linkjob.ai.