# Palindrome Pairs: Study Guide

Palindrome Pairs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Put every word into a hash map. For each word, try every split: if the left half is a palindrome and reverse(right) is another word, they form a pair, and symmetrically for the right half. Also handle the empty-string case.

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

## Common mistake

Checking every pair of words with a full palindrome test (O(n^2 L)), which TLEs, or forgetting that "" pairs with every palindrome.

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