How to find the longest palindrome substring by ignoring some characters

Asked Jun 14 '17 at 13:54

Active Aug 12 '21 at 19:32

Viewed 139 times

I searched this problem in the Google but can't find. A problem is a little bit different from the classic case:

Find the longest palindrome by ignoring some characters. For example: let's take 'abracadabra', here we can omit some characters and get "abadaba" as one of the possible longest palindrome ("ab_a__dab_a").

Can anyone suggest efficient algorithm?

edited Aug 12 '21 at 19:32

kaya3

47,440
4
68
97

asked Jun 14 '17 at 13:54

Bahriddin Abdiev

I found same question asked [here](https://stackoverflow.com/questions/10577422/create-palindrome-from-existing-string-by-removing-characters). – Bahriddin Abdiev Jun 14 '17 at 14:01
But how to find d[i+1, j], I have no idea :( – Bahriddin Abdiev Jun 14 '17 at 14:07

How to find the longest palindrome substring by ignoring some characters

0 Answers0