Rare card
Longest palindromic substring
- Value
- 50 W
- Attack
- 738
- Defence
- 591
- Players
- 0
In computer science, the longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous substring of a given string that is also a palindrome. For example, the longest palindromic substring of "bananas" is "anana".
Get Longest palindromic substring in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack