AOC Day 10 Part 2

gistfile1.txt

def find_number_of_permutations(tree):

    adapters = {}
    
    for i in tree:
        for j in tree[i]:
        
            if j not in adapters.keys():
                if i in adapters.keys():
                    adapters[j] = adapters[i]
                else: adapters[j] = 1
            else:
                adapters[j] = adapters[j] + (adapters[i])

    return adapters[max(adapters)]