classSolution:deflengthOfLongestSubstring(self, s:str)->int:
newlist =[]
left, right =0,0
maxlen =0iflen(s)==0:return0else:while right <len(s):
i = s[right]# print("newlist", newlist)if i notin newlist:
newlist.append(i)else:# print(i)# print(left, right)# print(s[left:right])while i in newlist:
newlist.pop(0)
left +=1
newlist.append(i)
right +=1
curlen = right - left
maxlen = curlen if curlen > maxlen else maxlen
return maxlen