1771. Maximize Palindrome Length From Subsequences

LeetCodeStringDynamic ProgrammingOpen on judge ↗

You are given two strings, word1 and word2. You want to construct a string in the following manner: - Choose some non-empty subsequence subsequence1 from word1. - Choose some non-empty subsequence subsequence2 from word2. - Concatenate the subsequences: subsequence1 + subsequence2, to make the string. Return the length of the longest palindrome that can be constructed in the described manner.

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI