Leetcode 1682. Longest Palindromic Subsequence II

Given a string, find the length of the longest palindromic subsequence you can form (a subsequence that reads the same forward and backward). This typically requires interval DP or memoized recursion comparing characters from both ends to compute the optimal subsequence length in O(n^2) time and space.