Ositus

def get_partitions(s):
    if len(s) > 0:
        for i in range(1, len(s)+1):
            first, rest = s[:i], s[i:]
            for p in get_partitions(rest):
                yield [first] + p
    else:
        yield []

topar = str(input())
partitions = get_partitions(topar)
alphabet = "abcdefghijklmnopqrstuvwxyz"

ans = 0
for partition in partitions:
    okk = True
    for part in partition:
        if okk == False:
            break

        count = {}
        for s in part:
            if s in count:
                okk = False
                break
            count[s] = 1
    if okk:
        ans += 1

print(int(ans % (1e9 + 7)))

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

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>
    for partition in partitions:
  File "input/code.py", line 5, in get_partitions
    for p in get_partitions(rest):
  File "input/code.py", line 5, in get_partitions
    for p in get_partitions(rest):
  File "input/code.py", line 5, in get_partitions
    for p in get_partitions(rest):
  [Previous line repeated 994 more times]
  File "input/code.py", line 3, in get_partitions
    for i in range(1, len(s)+1):
RecursionError: maximum recursion depth exceeded in comparison

Test 7

Group: 3

Verdict: RUNTIME ERROR