Palindrome Pairs Problem

Palindrome Pairs Problem — ExecCode Hard DSA Practice

Solve the Palindrome Pairs problem on ExecCode. Free online hard DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Palindrome Pairs. Trie of reversed words + palindrome checks. For Palindrome Pairs, focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

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

Constraints

1 ≤ n ≤ 10^5

Practice Palindrome Pairs free on ExecCode. Browse DSA problems, topic map, and placement guides.