# 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.
# Given a string s, return the number of unique non-empty substrings of s are present in base. # start from a, we have all substrings with length 1-23 # start from b, we have all substrings with ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results