Blog
Find the Longest Palindrome Substring in Java: Best Useful Solution
Finding the longest Palindrome substring is a classic problem of coding interview. Inthis post, I will summarize 3 different solutions for this problem. 3.1 Naive Approach Naively, we can simply examine every substring and check if it is palindromic. Thetime complexity is O(nˆ3). If this is submitted to LeetCode online Read more…