Q. Longest palindromic subsequence is an example of

(A) greedy algorithm
(B) 2d dynamic programming
(C) 1d dynamic programming
(D) divide and conquer

💬 Discuss

✅ Correct Answer: (B) 2d dynamic programming

Explanation: longest palindromic subsequence is an example of 2d dynamic programming.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

longest palindromic subsequence is an example of 2d dynamic programming.

💬 Discussion

📊 Question Analytics

👁️

941

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

93%

Success Rate