Sail E0 Webinar
Question
Longest palindromic subsequence is an example of ______________
Options:
A .  Greedy algorithm
B .  2D dynamic programming
C .  1D dynamic programming
D .  Divide and conquer
Answer: Option B


Longest palindromic subsequence is an example of 2D dynamic programming.



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers