Formatted question description: https://leetcode.ca/all/516.html
516. Longest Palindromic Subsequence Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Example 1: Input: "bbbab" Output: 4 One possible longest palindromic subsequence is "bbbb". Example 2: Input: "cbbd" Output: 2 One possible longest palindromic subsequence is "bb". Constraints: 1 <= s.length <= 1000 s consists only of lowercase English letters.
dp[i][j] is [i,j] longest Palindromic Subsequence in range [i,j]
/ dp[i + 1][j - 1] + 2 if (s[i] == s[j]) dp[i][j] = \ max(dp[i + 1][j], dp[i][j - 1]) if (s[i] != s[j])