Days 08-10 solved in python

[Stektpotet]

Didn't take the time to sit down and get these solutions added on the day, but here they are!

[Arxcis]

08,09,10 delivered with glans! 🤩

[Arxcis]

Aha najs optimization 👏

[Stektpotet]

if not any(s == lines[p+25] for s in map(sum, itertools.combinations(lines[p: p+25], 2))):

This one is pretty cool too imo:

because any accepts iterators, hence also generators or generator expressions, such as above, it will not exhaust the for loop when s==lines[p+25] is met for any single instance of s. mapalso behaves the same way, meaning that I'm effectively...

1. not summing any more combinations than neccessary, and
2. not creating any more combinations from the preamable.

making that line more effective than my original loop:

for p in range(len(lines) - 26):
    found=False
    for a, b in itertools.combinations(lines[p: p+25], 2):
        if a + b == lines[p + 25]:
            found = True
            break  # This break won't break me out of the outer loop, which is what I really want,
    if found:      # hence the 'found' check in the outer loop
        break      # writing it all in a function would also work - using `return` to jump out of the inner loop

[Arxcis]

Aha. So any and map are lazy-evaluating when working on generators.

[Stektpotet]

Essentially, yeah 🦖