# Two SAT Implication Graph Assignment: Study Guide

Two SAT Implication Graph Assignment shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each clause (a ∨ b) add ¬a→b and ¬b→a; the formula is satisfiable iff no variable and its negation share an SCC, then assign by reverse topological order.

## 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 + m) after SCC.

## Common mistake

Assigning true in topological order instead of reverse, which flips every answer.

## 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 interview copilot app.