# Palindrome Pairs (LC5423)

## Problem
Given unique words, find all index pairs (i,j) such that words[i]+words[j] is a palindrome.

## Approach
Hash map word->index. For each word, try all split points; if prefix is palindrome and reverse(suffix) exists (and vice versa), record pair. Handle empty string carefully.

## Complexity
O(n * L^2).

## Practice
String + hash map interviews — [linkjob.ai](https://www.linkjob.ai/).

## Notes
- Avoid i==j
- Empty word special case
- Dedup splits
