# Count Unhappy Friends: Walkthrough

Count Unhappy Friends shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A pair (x,y) is paired; x is unhappy if some preferred u prefers x over their own partner. After pairing, scan each person's preference prefix before their partner.

## 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^2).

## Common mistake

Using the preference lists as unordered sets, or counting a pair once when both sides are unhappy (the problem counts people, not pairs).

## 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 try it free.