Solution for day 9 of 2020 advent of code

advent_of_code_day_9.py

        
def advent_day_9_pt2(nums, sum_to_find):
    N = len(nums)
    for i in range(N):
        conta_set = []
        ts = nums[i]
        conta_set.append(ts)
        for k in range(i+1, N):
            ts += nums[k]
            conta_set.append(nums[k])
            if ts == sum_to_find:
                print('found')
                return conta_set
            if ts > sum_to_find:
                break
    return []

def advent_day_9_pt1():
    nums = []
    with open('input.txt', 'r') as file:
        lst = file.read().split('\n')
        for l in lst:
            if l == '':
                continue
            num = int(l)
            nums.append(num)
            
    pre_len = 25
    N = len(nums)
    sum_to_find = 0
    for i in range(pre_len, N):
        if not advent_day_9_preable_has_sum(nums[i-pre_len:i], nums[i]):
            sum_to_find = nums[i]
            break
    
    res = advent_day_9_pt2(nums, sum_to_find)
    res.sort()
    
    smallest = res[0]
    largest = res[len(res)-1]
    sol = smallest + largest
    print(sol)
    
if __name__ == '__main__':
    advent_day_9_pt1()