Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: "bab" Note: "aba" is also a valid answer. Example 2: Input: "cbbd"…
Now, I want to just use English to explain the problem, it's about two month before the interview, so I have to practice my oral English more. And I will write my explainations in my code in order to keep this passage looking comfortable. 101. Symmet…