a) Greedy algorithm
b) 2D dynamic programming
c) 1D dynamic programming
d) Divide and conquer
Longest palindromic subsequence is an example of ______________
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Longest palindromic subsequence is an example of ______________
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!