Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 336. Palindrome Pairs
Given an array of unique words, return all ordered index pairs (i, j) such that words[i] + words[j] is a palindrome. The optimal solution relies on detecting palindromic prefixes/suffixes and reverse lookups (e.g., hash/trie) to run in O(total length of all words).
Asked at:
Airbnb
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late March, 2025
Airbnb
Senior
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.