Approach Summary
Union-Find on 26 letters. First pass: union all "==" pairs. Second pass: check each "!=" — if variables share a root, return false.
How to Recognize This Pattern
- "Are equality/inequality equations satisfiable"
- Process all equality edges first, then check inequalities
Complexity Analysis
Time Complexity
O(n)
Space Complexity
O(26)
Tags
Array String Union-Find Graph