Leetcode 336. Palindrome Pairs

Given an array of unique words, return all ordered index pairs (i, j) such that words[i] + words[j] is a palindrome. The optimal solution relies on detecting palindromic prefixes/suffixes and reverse lookups (e.g., hash/trie) to run in O(total length of all words).