DigiNews

Tech Watch Articles

← Back to articles

Day 11: Reactor

Quality: 8/10 Relevance: 8/10

Summary

This Advent of Code 2025 day 11 thread on Tildes collects multiple community solutions and discussions around counting paths in a directed acyclic graph. Participants share implementations in Python, Rust, and C#, compare DFS vs BFS approaches, and discuss problem-specific nuances such as avoiding loops and leveraging memoization. The thread highlights common DP strategies and how input structure can guide efficient solutions.

🚀 Service construit par Johan Denoyer