leetcode 5 : longest palindromic substring : java solution

LeetCode problem 5, “Longest Palindromic Substring,“ challenges the solver to find the longest contiguous substring of a given string that reads the same forwards and backwards. This problem is typically solved using dynamic programming, expand-around-center techniques, or Manacher’s algorithm for optimal performance. Dynamic programming involves using a table to store results of subproblems, which are then used to determine whether a substring is palindromic and its length. The expand-around-center approach checks for palindromes by expanding around each character, while Manacher’s algorithm provides a linear time solution by transforming the string into a new form that facilitates easier palindrome detection. This problem tests the solver’s understanding of string manipulation and algorithm optimization.