# Goemans Williamson Max Cut SDP: Practice Notes

Goemans Williamson Max Cut SDP shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Relax max-cut to a vector program, solve the SDP, and randomly hyperplane-round the vectors for an expected 0.878 approximation.

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

Polynomial via an SDP solver, plus O(n^2) rounding.

## Common mistake

Rounding each coordinate independently instead of a random hyperplane, which loses the 0.878 guarantee.

## 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 AI interview helper that uses your resume.