- Brute-Force approach. Iterate over all substrings, check if the substring is palindrome. - If so, compare with current longest palindrome substring. - Skip the range less than the length of current ...

Given a string s, return the longest palindromic substring in s. A palindrome is a string that reads the same forward and backward. For example, "racecar" and "abba" are palindromes.