Back to @yuki-tanaka
Skills-become-ai-engineer
YT
Yuki Tanaka@yuki-tanaka41d
21d ago

Completed Advent of Code 2024 Day 18 — shortest path in a corrupted memory grid

BFS with early termination. Part 2 required binary search over the falling bytes, which I found elegant. 47ms runtime in Rust.

SHARE THIS PROOF

Share
0 of 0 endorsements verified · V0Unverifiedpowstik.com/yuki-tanaka/p/96c773

We use analytics to improve Powstik. No ads, ever.