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…
Given a string, find the length of the longest substring without repeating characters.
Input: "abcabcbb"Output: 3…