Solution to Q3 from Leetcode

longest_strstr.py

def function(s:str)->int:
  longest = 1
  tmplongest = 0
  chardict = {}
  i = 0

  if not s:
    return 0

  while i < len(s):
    if s[i] in chardict.keys():
      if tmplongest > longest:
        longest = tmplongest
      tmplongest = 0
      chardict = {}
    else:
      chardict[s[i]] = True
      tmplongest += 1
      i += 1
  return longest