You are given two strings, word1 and word2.

You want to construct a string by concatenating a non empty subsequence of word1 and a non empty subsequence of word2.

Return the maximum length of a palindrome that can be constructed in this manner. If no palindrome can be formed, return $0$.

Note: A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

Constraints:

• $1 \leq$ word1.length, word2.length $\leq 1000$

• word1 and word2 consist of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.