Phishing — Merry Clickmas | Tryhackme | Day-2 Advent of Cyber 2025 | Walkthrough Hey my dear readers_ Today, we are solving the TryHackMe Advent of Cyber Prep Track 2025. Advent of Cyber wasn’t...
#tryhackme #phishing #aoc2025 #advent-of-cyber-2025 #cybersecurity
Origin | Interest | Match
Advent of Cyber Prep Track | Tryhackme | Day-0 Advent of Cyber 2025 | Walkthrough Hey my dear readers_ Today, we are solving the TryHackMe Advent of Cyber Prep Track 2025. Advent of Cyber wasn’t ...
#advent-of-cyber-2025 #tryhackme #aoc2025 #cybersecurity #redteamjourney
Origin | Interest | Match
Juan Vazquez and Cameron Cunning rejoin the show to discuss how we fared with the 2025 Advent of Code competition.
#rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming
straypointers.com/e/s4e01.htm
Random.Code() Advent of Code 2025 Part 1 live coding stream!
#AoC2025 #dotnet #csharp
www.youtube.com/watch?v=72s9...
I've completed "Lobby" - Day 3 - Advent of Code 2025 #AdventOfCode #aoc2025 adventofcode.com/2025/day/3
Solution Code => github.com/wanderingeek...
Well, today's #AdventOfCode puzzle was fairly great. Perl did complain a bit about deep recursion, though. It does have a good reason to complain, but in the end it did the job.
"You don't have enough stars to finish decorating the North Pole, though. You need 2 more."
Bah.
#AoC2025
I've completed this year's #AdventofCode #AoC2025!
Huge thanks to @was.tl for such an engaging challenge. This is my first time solving every problem, although I did get some help for the last couple of days.
I'm excited to build on what I've learned for next year's challenges!
Day 12 - "Christmas Tree Farm" ✅
There was only one part, and I just couldn't come up with the logic myself to solve this challenge. 😑
My solutions - github.com/GKay-Dev/Adv...
Advent of Code 2025 - adventofcode.com/2025/day/12
#AdventOfCode #Python #Coding #Challenges #100Devs #AoC2025
Is day 12 just on another level, or am I over thinking it? 🤔
#AdventofCode #AoC2025 #Python
i think i'm leaving #aoc2025 . sorry. i'm not that good for such challenges. sorry
el #aoc2025 #AdventOfCode de hoy es de esos que si sabes matemáticas son tres líneas de código... literal
Day 11 - "Reactor" ✅
Part 1 was easier; I used a similar approach as before.
For part 2, I had to add memoization.
Just one more day to go. 😔
My solutions - github.com/GKay-Dev/Adv...
Advent of Code 2025 - adventofcode.com/2025/day/11
#AdventOfCode #Python #Coding #Challenges #100Devs #AoC2025
Me: In #AdventOfCode this year, I'm going to find out how to write highly efficient scripts such that every full puzzle solution takes much less than a minute running locally on my laptop
Me on Day 10: I meant "on most days"
#AoC2025
Day 10 - "Factory" ✅
Today's challenge was tough for me, both parts. Couldn't figure out the logic without getting some help.
My solutions - github.com/GKay-Dev/Adv...
Advent of Code 2025 - adventofcode.com/2025/day/10
#AdventOfCode #Python #Coding #Challenges #100Devs #AoC2025
![# AOC 2025 Day 9 - expect input on stdin
red = [eval(l.strip()) for l in open(0)]
def I(a, b): return range(min(a, b), max(a, b) + 1)
def A(a, b): return len(I(a[0], b[0]))*len(I(a[1], b[1]))
xs = sorted({x for x,_ in red} | {-1, 1000000})
ys = sorted({y for _,y in red} | {-1, 1000000})
kred = [(xs.index(x), ys.index(y)) for x, y in red]
kgrid = [['.']*len(xs) for _ in ys] # Kompress the grid!
lx, ly = kred[-1] # Draw the lines
for x, y in kred:
for x1 in I(lx, x):
for y1 in I(ly, y): kgrid[y1][x1] = '#'
lx, ly = x, y
stack = [(0, 0)] # Remove the outside
while stack:
x, y = stack.pop()
if 0 <= x < len(xs) and 0 <= y < len(ys) and kgrid[y][x] == '.':
kgrid[y][x] = ' '
stack.extend([(x+1,y), (x-1, y), (x, y+1), (x, y-1)])
print(max(A(a, b) for i, a in enumerate(red) for b in red[:i])) # Part 1
print(max(A((xs[x1], ys[y1]), (xs[x2], ys[y2]))
for i, (x1,y1) in enumerate(kred) for (x2,y2) in kred[:i]
if all(kgrid[y][x] != ' ' for x in I(x1, x2) for y in I(y1, y2))
)) # Part 2](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:lluzy7kvsuszpz3cle5vt64s/bafkreieyrspbazkx4t4x2sijf7364cwlf47725dqxm7wi4lhsxdss7b3cy)
# AOC 2025 Day 9 - expect input on stdin red = [eval(l.strip()) for l in open(0)] def I(a, b): return range(min(a, b), max(a, b) + 1) def A(a, b): return len(I(a[0], b[0]))*len(I(a[1], b[1])) xs = sorted({x for x,_ in red} | {-1, 1000000}) ys = sorted({y for _,y in red} | {-1, 1000000}) kred = [(xs.index(x), ys.index(y)) for x, y in red] kgrid = [['.']*len(xs) for _ in ys] # Kompress the grid! lx, ly = kred[-1] # Draw the lines for x, y in kred: for x1 in I(lx, x): for y1 in I(ly, y): kgrid[y1][x1] = '#' lx, ly = x, y stack = [(0, 0)] # Remove the outside while stack: x, y = stack.pop() if 0 <= x < len(xs) and 0 <= y < len(ys) and kgrid[y][x] == '.': kgrid[y][x] = ' ' stack.extend([(x+1,y), (x-1, y), (x, y+1), (x, y-1)]) print(max(A(a, b) for i, a in enumerate(red) for b in red[:i])) # Part 1 print(max(A((xs[x1], ys[y1]), (xs[x2], ys[y2])) for i, (x1,y1) in enumerate(kred) for (x2,y2) in kred[:i] if all(kgrid[y][x] != ' ' for x in I(x1, x2) for y in I(y1, y2)) )) # Part 2
AOC 2025 Day 9. #aoc2025 #python. Really couldn't make this one concise. Part 2 has 3 steps: (a) kompress grid, (b) draw outline, (c) find area. Part (a) is there only to make it fast...
![# AOC 2025 Day 8 - expect input on stdin
boxes = sorted(eval(l.strip()) for l in open(0))
def d2(a, b): return (b[0]-a[0])**2 + (b[1]-a[1])**2 + (b[2]-a[2])**2
close = sorted((d2(a, b), a, b) for i, a in enumerate(boxes) for b in boxes[:i])
circuits = []
for n, (_, a, b) in enumerate(close):
if n == 1000:
x, y, z = sorted((len(c) for c in circuits), reverse=True)[:3]
print(x*y*z) # Part 1
cont = [c for c in circuits if a in c or b in c]
if not cont:
circuits.append({a,b})
elif len(cont) == 2:
c1, c2 = cont
c1.update(c2)
circuits.remove(c2)
else:
c, = cont
if not(a in c and b in c):
c.add(a)
c.add(b)
if len(circuits[0]) == len(boxes):
print(a[0]*b[0]) # Part 2
break](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:lluzy7kvsuszpz3cle5vt64s/bafkreiaurfyrxsgfp2gmqtjkvesapxbzwa5ig7ng6is5yllehtuhvsfo2m)
# AOC 2025 Day 8 - expect input on stdin boxes = sorted(eval(l.strip()) for l in open(0)) def d2(a, b): return (b[0]-a[0])**2 + (b[1]-a[1])**2 + (b[2]-a[2])**2 close = sorted((d2(a, b), a, b) for i, a in enumerate(boxes) for b in boxes[:i]) circuits = [] for n, (_, a, b) in enumerate(close): if n == 1000: x, y, z = sorted((len(c) for c in circuits), reverse=True)[:3] print(x*y*z) # Part 1 cont = [c for c in circuits if a in c or b in c] if not cont: circuits.append({a,b}) elif len(cont) == 2: c1, c2 = cont c1.update(c2) circuits.remove(c2) else: c, = cont if not(a in c and b in c): c.add(a) c.add(b) if len(circuits[0]) == len(boxes): print(a[0]*b[0]) # Part 2 break
![# AOC 2025 Day 7 - expect input on stdin
T, *Sv = [[c != '.' for c in l.strip()] for l in open(0)]
splits, n = 0, len(T)
for S in Sv:
splits += sum(1 for t, z in zip(T, S) if t > 0 and z)
T = [T[i]*(1-S[i])
+ (i>0 and T[i-1]*S[i-1])
+ (i+1<n and T[i+1]*S[i+1])
for i in range(n)]
print(splits) # Part 1
print(sum(T)) # Part 2](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:lluzy7kvsuszpz3cle5vt64s/bafkreibobc2jjm6t6un4ackjlv6f4pirl7nb664ef4pyglq2jh6fqojkbu)
# AOC 2025 Day 7 - expect input on stdin T, *Sv = [[c != '.' for c in l.strip()] for l in open(0)] splits, n = 0, len(T) for S in Sv: splits += sum(1 for t, z in zip(T, S) if t > 0 and z) T = [T[i]*(1-S[i]) + (i>0 and T[i-1]*S[i-1]) + (i+1<n and T[i+1]*S[i+1]) for i in range(n)] print(splits) # Part 1 print(sum(T)) # Part 2
![# Day 6 - expect input on stdin
import operator as op
lines = [l.strip('\n') for l in open(0)]
# Part 1
print(sum(eval(c.join(ns))
for c, *ns in zip(*[l.split() for l in lines[::-1]])))
nums = [''.join(z) for z in zip(*lines[:-1])]
S, s, f = 0, 0, op.add
for i, c in enumerate(lines[-1]):
if c != ' ':
S, s = S+s, int(nums[i])
f = op.add if c == '+' else op.mul
elif nums[i].strip() != '':
s = f(s, int(nums[i]))
print(S+s) # Part 2](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:lluzy7kvsuszpz3cle5vt64s/bafkreieaxt2bndm7cva3qmx3fzoi7jwsd7lj6ysqdefqgzbslabspkn4ay)
# Day 6 - expect input on stdin import operator as op lines = [l.strip('\n') for l in open(0)] # Part 1 print(sum(eval(c.join(ns)) for c, *ns in zip(*[l.split() for l in lines[::-1]]))) nums = [''.join(z) for z in zip(*lines[:-1])] S, s, f = 0, 0, op.add for i, c in enumerate(lines[-1]): if c != ' ': S, s = S+s, int(nums[i]) f = op.add if c == '+' else op.mul elif nums[i].strip() != '': s = f(s, int(nums[i])) print(S+s) # Part 2
![# Day 5 - expect input on stdin
S1, S2 = open(0).read().split('\n\n')
R = [(int(x), int(y)) for x, y in (l.split('-') for l in S1.split())]
I = [int(x) for x in S2.split()]
print(sum(1 for i in I if any(x <= i <= y for x, y in R))) # Part 1
count, level = 0, 0.5
for x, d in sorted(i for x, y in R for i in ((x-1, -1), (y, 1))):
if (level + d) * level < 0:
count += x*d
level += d
print(count) # Part 2](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:lluzy7kvsuszpz3cle5vt64s/bafkreid6nicvx553ddimyvb5eddelbivy32tfs5scd4mpnb2lskiq4zhc4)
# Day 5 - expect input on stdin S1, S2 = open(0).read().split('\n\n') R = [(int(x), int(y)) for x, y in (l.split('-') for l in S1.split())] I = [int(x) for x in S2.split()] print(sum(1 for i in I if any(x <= i <= y for x, y in R))) # Part 1 count, level = 0, 0.5 for x, d in sorted(i for x, y in R for i in ((x-1, -1), (y, 1))): if (level + d) * level < 0: count += x*d level += d print(count) # Part 2
When removing debugging output I had removed one line too many, so it didn't actually exclude the things it should exclude. Now it does, and finishes in 20 minutes, but the answer is wrong (it is right for the sample input, interestingly). Weird.
#AdventOfCode #AoC2025
Chosing a slightly more compact map representation than the ASCII one from the example text would probably have helped. The script is holding steady at 9 gigabytes of RAM used, having used about 100 minutes of CPU time so far...
#AdventOfCode #AoC2025
I'm fairly certain there must be an algorithm that can do #AdventOfCode 2025 day 8 part 2 faster then my naïve Perl implementation, which has been running for an hour now...
#aoc2025
Day 09 - "Movie Theater" ✅
Part 1 was way too easy. Brute forced in 5 min.
Couldn't figure out the logic for part 2 without some external help.
My solutions - github.com/GKay-Dev/Adv...
Advent of Code 2025 - adventofcode.com/2025/day/9
#AdventOfCode #Python #Coding #Challenges #100Devs #AoC2025
🎄Advent of Code
Retrouvez tous les jours @punkstarman.bsky.social sur sa chaine Twitch qui s'attaque au défi du jour en live.
🔴Cela se passe sur sa chaine Twitch
www.twitch.tv/le_code_cont...
bsky.app/profile/punk...
#AdventOfCode #AoC2025
Todays AoC puzzle confuses a bit. Why do they connect already connected boxes?
#aoc2025 #aoc2025day8
Day 08 - "Playground" ✅
I had difficulty figuring out part 2.
Overall, today's challenge was interesting.
My solutions - github.com/GKay-Dev/Adv...
Advent of Code 2025 - adventofcode.com/2025/day/8
#AdventOfCode #Python #Coding #Challenges #100Devs #AoC2025
Day 07 - "Laboratories" ✅
Rebuilt manifold for part 1 (overhead 🙁).
Thought of using Graph Traversal Algos for part 2. Later found a simpler way.
My solutions - github.com/GKay-Dev/Adv...
Advent of Code 2025 - adventofcode.com/2025/day/7
#AdventOfCode #Python #Coding #Challenges #100Devs #AoC2025
