What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
|Answer» B. o(2n)|
|Explanation: in the brute force algorithm, all the subsequences are found and the length of the longest palindromic subsequence is calculated. this takes exponential time.|
Login to Continue
It will take less than 2 minutes