Longest palindromic subsequence is an example of ______________
(a) Greedy algorithm
(b) 2D dynamic programming
(c) 1D dynamic programming
(d) Divide and conquer
I got this question in an internship interview.
This interesting question is from Longest Palindromic Subsequence topic in section Dynamic Programming of Data Structures & Algorithms II