Palindrome Pairs

Try to solve the Palindrome Pairs problem.

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, 00 \leq i, j << ...