Microsoft Interview Question: Give brute force, divide and conquer, dynamic programming solutions to the Longest Palindromic Subsequence problem, and discuss space/time tradeoffs.

Notifications

Microsoft

Give brute force, divide and conquer, dynamic programming solutions to the Longest Palindromic Subsequence problem, and discuss space/time tradeoffs.