Longest palindromic subsequence is an example of

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Design and Analysis of Algorithms

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.

Explanation by: Mr. Dubey

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

💬 Discussion

📊 Question Analytics

👁️

917

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate