Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Longest Substring of Unique Characters by kavishhh
def longest_substr(s: str) -> int:
# your code here
seen = {}
start = 0
max_length = 0
for i, char in enumerate(s):
if char in seen and seen[char] >= start:
start = seen[char] + 1
seen[char] = i
max_length = max(max_length, i - start + 1)
return max_length
print("Example:")
print(longest_substr("abcabcbb"))
# These "asserts" are used for self-checking
assert longest_substr("abcabcbb") == 3
assert longest_substr("bbbbb") == 1
assert longest_substr("pwwkew") == 3
assert longest_substr("abcdef") == 6
assert longest_substr("") == 0
assert longest_substr("au") == 2
assert longest_substr("dvdf") == 3
print("The mission is done! Click 'Check Solution' to earn rewards!")
Sept. 22, 2025
Comments:
