Ositus

from itertools import combinations
x = input()
list1 = []
list1[:0]= x
same = 0
maara = 0

def has_duplicates2(seq):
	seen = []
	unique_list = [x for x in seq if x not in seen and not seen.append(x)]
	return len(seq) != len(unique_list)


y = [list1[s:e] for s, e in combinations(range(len(x)+1),2)]

for i in range (len(y)):
	same = has_duplicates2(y[i])
	if not same:
		maara += 1

print(maara%(pow(10, 9)+7))

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED