Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1771. Maximize Palindrome Length From Subsequences
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.