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 words.length), and i is not equal to j. The key condition is that when the word at index i is concatenated with the word at index j (forming words[i] + words[j]), the resulting string must be a palindrome.
Your task is to return all valid palindrome pairs as a list of index pairs.
Additionally, your solution must have a time complexity of words.length
Constraints:
words.length
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 words.length), and i is not equal to j. The key condition is that when the word at index i is concatenated with the word at index j (forming words[i] + words[j]), the resulting string must be a palindrome.
Your task is to return all valid palindrome pairs as a list of index pairs.
Additionally, your solution must have a time complexity of words.length
Constraints:
words.length