Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters. Letters are case sensitive, for example, "Aa" is ...

This project implements a classic dynamic programming solution to find the Longest Palindromic Subsequence (LPS) in a given string. Given a string X, the goal is to find the longest subsequence of X ...