# Couples Holding Hands: Study Guide

Couples Holding Hands shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Treat each sofa pair as a node and union the two people who currently sit there with the partners they should sit with. Each union merges two couple-cycles; the swaps needed are n minus the number of already-correct couple components.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 α(n)).

## Common mistake

Greedily swapping any mismatched pair without tracking the permutation of couples, which can overcount.

## 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 best AI tool for coding tests and OAs.