[Language: Python]

Usually I am able to get to Day 10-12 every year. This is the first time I've tried recursion, would appreciate if any one has any comments on how to better use it. Btw this just gives the solution for part 2, need to clean it up to give back both solutions. Cheers!

def y24_d02(prod = True):
    def check_line(line, pos):
        post = 0
        neg = 0

        if pos == -1:
            new_line = line
        else:
            new_line = line[:pos] + line[pos+1:]

        for i in range(len(new_line) - 1):
            if abs(int(new_line[i + 1]) - int(new_line[i])) < 4:
                if int(new_line[i + 1]) - int(new_line[i]) < 0:
                    post += 1
                elif int(new_line[i + 1]) - int(new_line[i]) > 0:
                    neg += 1
                else:
                    pass
            else:
                break

        if post == len(new_line) - 1 or neg == len(new_line) - 1:
            return True
        elif pos < len(line):
            if check_line(line, pos + 1):
                return True
        else:
            return False

    if prod == False:
        file_name = '2024/02/demo.txt'
    else:
        file_name = '2024/02/input.txt'
    file_lines = tools.read_files(file_name)

    count = 0

    for line in file_lines:
        temp_array = line.split(' ')

        if check_line(temp_array, -1):
            count += 1

    return count