152. Longest Palindromic Subsequence

Write a function solve that finds the length of the longest palindromic subsequence in a string. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

Example:
Input: "bbbab"
Output: 4
Explanation: The longest palindromic subsequence is "bbbb".

Run this challenge interactively in Python or JavaScript when the app loads.