When we work with strings in programming, we regularly have to extract some part of them. For example, we need to figure out if a smaller string is present inside a larger one. In this lesson, we will ...

# Given a string S, find the longest palindromic substring in S. # You may assume that the maximum length of S is 1000, # and there exists one unique longest palindromic substring.