Q43
What is the time complexity of the Dynamic Programming solution for the "Longest Palindromic Substring" problem?
A.
O(n log n)
B.
O(n)
C.
O(n2)
AnswerD.
O(log n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board