Longest substring without repeats
Given a string, return the length of the longest substring without repeating characters.
Implement
length_of_longest_substring(s: str) → intExamples
in
["abcabcbb"]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
["abcabcbb"]3not run yetsample