Palindrome Pairs · Coding Interview Practice

Palindrome PairsGiven a list of unique words, return every pair of distinct indices (i, j) such that words[i] + words[j] is a palindrome.Constraints

1 <= words.length <= 5000

0 <= words[i].length <= 300

words[i] consists of lowercase English letters

Examples

Input: words = ["abcd", "dcba", "lls", "s", "sssll"] Output: [[0, 1], [1, 0], [3, 2], [2, 4]]

Input: words = ["bat", "tab", "cat"] Output: [[0, 1], [1, 0]]

LetsDiscuss

Loading your session…