🚀 Advent of Code Day 11 – Counting Paths Like a ProMemoized DFS, Clean Graph Parsing & High-Performance Path Logic (Pseudocode Only) When Advent of Code reaches the double digits, problems stop being cute and start becoming mathematically evil.Day 11 was exactly that — a deceptively simple “count all...3 min read·rakshapahariya.hashnode.devDec 11, 2025
Advent of Code Day 10 --- Optimizing Dual-Mode MachinesLearn how to solve Advent of Code Day 10 efficiently with modular Python code. Explore XOR bitmask BFS for indicator lights, CP-SAT integer programming for4 min read·rakshapahariya.hashnode.devDec 10, 2025
Advent of Code Day 9 guide using maths! Movie Theater TilesA Clean, Modular & Powerful Approach (Pseudocode + Theory) Advent of Code Day 9 presented a fascinating challenge — a grid-based puzzle inspired by a movie theater floor. The problem involves red tiles on a grid and asks for the largest rectangle usi...3 min read·rakshapahariya.hashnode.dev1DDec 9, 2025
Master Graph Connections in Advent of Code 2025 - Day 08 GuideUse Union-Find techniques in Advent of Code 2025 for efficient graph connection problem-solving with modular methods5 min read·rakshapahariya.hashnode.devDec 8, 2025
Advent of Code Day 7: Comparing Classical and Quantum BeamsExplore a clean, modular approach to solve Advent of Code Day 7 using classical and quantum beam simulations with scalable pseudocode3 min read·rakshapahariya.hashnode.devDec 7, 2025