The link of the question is https://practice.geeksforgeeks.org/problems/longest-palindromic-subsequence/0 . May I know whether my approach is a correct solution using Dynami
