Q265
What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
A.
O(1)
B.
O(2n)
AnswerC.
O(n)
D.
O(n2)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board