left_len = self.longestNiceSubstring(s[0:i]) # index 0 to i-1 right_len = self.longestNiceSubstring(s[i+1:len(s)+1]) # index i+1 to end Then if we see, all the characters have their lowercase and ...
Set maxi as the first character of the string: maxi = s[0]. Set m as the guarenteed minimum answer of the string : m = 1. Takes two indices left and right which attempts to expand outwards from the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback