Longest Palindromic Subsequence — Solution & Editorial | Jobs at Avian IT

Hiring process8 levels

1 IQ Test
2 Additional Online Test (If Required)
3 Office Interview with Hiring Manager
4 Unpaid Test Task (Motivation Check)
5 Paid Test Task and Follow-Up Interview
6 Iterative Paid Test Tasks
7 Office Verification
8 Final Interview with the Founder

Problems > Longest Palindromic Subsequence > Editorial

Longest Palindromic Subsequence — Solution & Editorial

It equals the LCS of S and its reverse — reuse the LCS table.

Complexity: O(|S|²)