Available question text
Given two strings, pick a non-empty subsequence from each, concatenate them, and return the maximum length of a palindrome obtainable; equivalently, find the longest palindromic subsequence of word1+word2 that uses at least one character from both originals, typically solved with dynamic programming over index pairs.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1771. Maximize Palindrome Length From Subsequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source