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.