Question
Longest palindromic subsequence is an example of ______________
Answer: Option B
Was this answer helpful ?
Longest palindromic subsequence is an example of 2D dynamic programming.
Was this answer helpful ?
Submit Solution