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 | 76 c. | Top 9% | |
#2 | 97 c. | Top 18% | |
#3 | 100 c. | Top 36% | |
#4 | 103 c. | Top 45% | |
#5 | 122 c. | Top 55% | |
#6 | 124 c. | Top 64% | |
#7 | 149 c. | Top 73% | |
#8 | 189 c. | Top 82% | |
#9 | 717 c. | Top 91% | |
#10 | 1326 c. | Top 100% |