Задача на поиск подстроки

s = input()
length_min = len(s)
 
for left in range(len(s)):
    for right in range(left, len(s):
        if len(set(s)) == len(set(s[left:right+1])):
            length_min = min(length_min, right + 1 - left)
            break
print(length_min)

s = input()
length_min = len(s)
length_substr = len(set(s))
 
for left in range(len(s)-length_substr):
    for right in range(left+length_substr, len(s)):
        if length_substr == len(set(s[left:right])):
            length_min = min(length_min, right - left)
            break
print(length_min)

indexes ={}
for x in set(s):
    indexes.setdefault(x, [_.start() for _ in re.finditer(x, s)] )
left, right = 0, max(min(x) for x in indexes.values())
current_min = right - left + 1
while right < len(s):
    n = min([_ for _ in indexes.get(s[left:left+1]) if _ > left], default = len(s))
    right = max(right, n)
    left += 1
    current_min = min (current_min, right - left + 1)
print(current_min)

from random import seed, choice
alphabet = 'abcdefghijklmnopqrstuvwxyz'
alphabet += alphabet.upper()
#s = input()
len_s = 100000
seed(42)
s =''.join([choice(alphabet) for _ in range(len_s)])

import re
from time import time
 
start = time()
indexes ={}
for x in set(s):
    indexes.setdefault(x, [_.start() for _ in re.finditer(x, s)] )
left, right = 0, max(min(x) for x in indexes.values())
current_min = right - left + 1
while right < len(s):
    next_pos = min([_ for _ in indexes.get(s[left:left+1]) if _ > left], default = len(s))
    right = max(right, next_pos)
    left += 1
    current_min = min (current_min, right - left + 1)
print(current_min)
print(f'Время выполнения {time()-start:.3f}с')
 
#100
#Время выполнения 9.891с

import re
from time import time
from sortedcontainers import SortedList
 
start = time()
indexes ={}
for x in set(s):
    indexes.setdefault(x, SortedList([_.start() for _ in re.finditer(x, s)]+[len(s)]) )
 
left, right = 0, max(min(x) for x in indexes.values())
current_min = right - left + 1
while right < len(s) - 1:
    next_pos = next(indexes.get(s[left:left+1]).irange(left, inclusive=(False, True)))
    right = max(right, next_pos)
    left += 1
    current_min = min (current_min, right - left + 1)
print(current_min)
print(f'Время выполнения {time()-start:.3f}с')
 
#100
#Время выполнения 0.360с

import re
from time import time
 
start = time()
indexes, pointers ={},{}
for x in set(s):
    indexes.setdefault(x, [_.start() for _ in re.finditer(x, s)] +[len(s)] )
    pointers.setdefault(x,0)
 
left, right = 0, max(min(x) for x in indexes.values())
current_min = right - left + 1
while right < len(s):
    left_char = s[left:left+1]
    pointers[left_char] += 1
    next_pos = indexes[left_char][pointers[left_char]]
    right = max(right, next_pos)
    left += 1
    current_min = min (current_min, right - left + 1)
print(current_min)
print(f'Время выполнения {time()-start:.3f}с')
 
#100
#Время выполнения 0.151с

start = time()
indexes = {}
for x in set(list(s)):
    indexes.setdefault(x, re.finditer(x, s) )
 
left, right = 0, max(next(x).start() for x in indexes.values())
current_min = right - left + 1
while right < len(s):
    left_char = s[left:left+1]
    try:
        next_pos = next(indexes[left_char]).start()
    except:
        next_pos = len(s)
    right = max(right, next_pos)
    left += 1
    current_min = min (current_min, right - left + 1)
print(current_min)
print(f'Время выполнения {time()-start:.3f}с')