Palindrome Pairs
Explore how to identify index pairs in a list of unique strings where their concatenation forms a palindrome. Understand the use of trie data structures to achieve efficient string operations and meet time complexity constraints. Implement solutions that return all valid palindrome pairs with optimized performance.
We'll cover the following...
We'll cover the following...
Statement
You are given a 0-indexed array of unique strings called words.
A palindrome pair is defined as a pair of indexes (i, j) where both i and j are within the valid range of the list of words (that is, i, j