# 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 ...
# Given a string, your task is to count how many palindromic substrings in this string. # The substrings with different start indexes or end indexes are counted as # different substrings even they ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results