Оптимизация задачи по алгоритмам

def is_suprefix(t, s):
    # Check if the word starts and ends with the given pattern
    return t[:len(s)] == s and t[-len(s):] == s
 
n = int(input())
dictionary = [input().strip() for _ in range(n)]
 
m = int(input())
patterns = [input().strip() for _ in range(m)]
 
# Для каждого шаблона подсчитайте, сколько слов являются "супрефиксами"
for pattern in patterns:
    count = 0
    pattern_len = len(pattern)  # Длина шаблона
    for word in dictionary:
        word_len = len(word)  # Длина слова
        # Пропустите слово, если оно короче шаблона
        if word_len >= pattern_len:
            # Проверка на "супрефикс"
            if word[:pattern_len] == pattern and word[-pattern_len:] == pattern:
                count += 1
    print(count)

n = int(input())
dictionary = [input().strip() for _ in range(n)]
 
m = int(input())
patterns = [input().strip() for _ in range(m)]
 
for pattern in patterns:
    count = 0
    for word in dictionary:
        if word.startswith(pattern) and word.endswith(pattern):
            count += 1
    print(count)

from collections import Counter
 
words = Counter(input() for _ in range(int(input())))
patterns = {}
result = []
for _ in range(int(input())):
    pattern = input()
    if pattern not in patterns:
        patterns[pattern] = sum(
            count
            for word, count in words.items()
            if word.startswith(pattern) and word.endswith(pattern)
        )
    result.append(patterns[pattern])
 
print(*result, sep="\n")

def all_suprefix(s):
    return {s[:i] for i in range(1, len(s)+1) if s[:i] == s[-i:]}
 
n = int(input())
dictionary = [input().strip() for _ in range(n)]
 
m = int(input())
patterns = [input().strip() for _ in range(m)]
 
result = {pattern: 0 for pattern in patterns}
for word in dictionary:
    for sfx in all_suprefix(word) & result:
        result[sfx] += 1
 
print(*map(lambda x: result[x], patterns), sep="\n")

for sfx in all_suprefix(word) & set(result):

def all_suprefix(s):
    return {s[:i] for i in range(1, len(s)+1) if s[:i] == s[-i:]}
 
n = int(input())
dictionary = [input().strip() for _ in range(n)]
 
m = int(input())
patterns = [input().strip() for _ in range(m)]
 
result = {pattern: 0 for pattern in patterns}
result_set = set(result)
for word in dictionary:
    for sfx in all_suprefix(word) & result_set:
        result[sfx] += 1
 
print(*map(lambda x: result[x], patterns), sep="\n")