Ositus

def calculateWrongPartitions(s):
  substraction = 0
  a, b = s[0 : len(s) -1], s[1 : len(s)]

  if(not len(a)==len(set(a))):
    substraction += 1 + calculateWrongPartitions(a)
  if(not len(b) == len(set(b))):
    substraction += 1 + calculateWrongPartitions(b)

  return substraction
  
s = input()

partitions = pow(2, len(s)-1) - 1
partitions -= calculateWrongPartitions(s)

print(partitions)

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

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: TIME LIMIT EXCEEDED

Test 6

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 15, in <module>
    partitions -= calculateWrongPartitions(s)
  File "input/code.py", line 6, in calculateWrongPartitions
    substraction += 1 + calculateWrongPartitions(a)
  File "input/code.py", line 6, in calculateWrongPartitions
    substraction += 1 + calculateWrongPartitions(a)
  File "input/code.py", line 6, in calculateWrongPartitions
    substraction += 1 + calculateWrongPartitions(a)
  [Previous line repeated 995 more times]
  File "input/code.py", line 5, in calculateWrongPartitions
    if(not len(a)==len(set(a))):
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED