Page 1 of 1

What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?

Posted: Wed Jul 13, 2022 7:40 pm
by answerhappygod
a) O(1)
b) O(2n)
c) O(n)
d) O(n2)