# Process Restricted Friend Requests: Practice Notes
Process Restricted Friend Requests shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Union-Find the accepted friendships. For each request, reject it when any restriction would place two restricted people inside the same component after the prospective union; otherwise union and accept.
## 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+q) α(n) * r) with a small restriction list, or smarter prechecks.
## Common mistake
Unioning first and then checking restrictions, which cannot undo an illegal merge.
## 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.