Given a string s, return the length of the longest subsequence of s that is a palindrome.

A subsequence is formed by deleting zero or more characters from s without changing the relative order of the remaining characters.

Constraints:

• $1 \leq$ s.length $\leq 1000$

• s consists only 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.