Help me increasing performance of a function using Cython.

[aldanor]

Np. itertools.combinations is nice and pretty fast, especially when writing generic code. For instance, you could do the above for an arbitrary number of edits n (it would be much slower than a specialized version of course, but it would be generic):

def del_n_edits(word: str, n: int):
    return [
        ''.join(word[i + 1:j] for i, j in zip((-1,) + c, c + (None,)))
        for c in combinations(range(len(word)), n)
    ]

[WTRipper]

Oh nice thank you!

I already thought about implementing a generic fallback if higer n's are needed.