Find the longest palindromic substring of a given string.
Given a string of random lowercase characters, find the longest palindromic substring. A palindrome is a word that reads the same backward as forward. For example, racecar
is a palindrome. In the case of multiple palindromes with the same length, return the first one found.
# | Size | % | Users |
---|---|---|---|
#1 | 97 c. | Top 20% | |
#2 | 122 c. | Top 40% | |
#3 | 124 c. | Top 60% | |
#4 | 149 c. | Top 80% | |
#5 | 189 c. | Top 100% |