Definitions from Wikipedia (Longest palindromic substring)

▸ noun:  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.


▸ Words similar to Longest palindromic substring
▸ Usage examples for Longest palindromic substring

▸ Idioms related to Longest palindromic substring
▸ Wikipedia articles (New!)
▸ Words that often appear near Longest palindromic substring
▸ Rhymes of Longest palindromic substring

▸ Invented words related to Longest palindromic substring