Fix algorithm

[rohaquinlop]

When writing a try/except count on the amount of exceptions.

try:
    ...
except ...:
    ...
except: ...:
    ...

Check how is being calculated the elif statement, it should be considered at the "same" level as the previous if statement

def has_sequence(value: str, sequence_size: int = 3) -> bool:
    if len(value) < sequence_size or sequence_size <= 0:
        return False

    sequence: list[int] = [ord(value[0])]
    is_increasing = False
    for char in value[1:]:
        current_ord: int = ord(char)

        if sequence[-1] + 1 == current_ord:
            if len(sequence) == 1:
                is_increasing = True
            sequence = sequence_increasing(
                char, current_ord, sequence, is_increasing
            )
        elif sequence[-1] - 1 == current_ord:
            if len(sequence) == 1:
                is_increasing = False
            sequence = sequence_decreasing(
                char, current_ord, sequence, is_increasing
            )
        else:
            sequence = [current_ord]

        if len(sequence) == sequence_size:
            return True

    return False

When assigning with an increase operation is counting incorrectly

a = a + 1 # 0
b = a + 2 # 0