This repository contains solutions to Jane Street's monthly puzzles, with focus of use of modern C++ for computational solutions. No external SAT/SMT solver libraries (such as Z3) are used in this repository, with emphasis of coming up with the fastest solution as possible by thinking around the puzzle (e.g. finding the earliest exits during backtracking). Some solutions are much faster than using SAT/SMT solvers (<1ms). Sometimes, puzzles when SAT/SMT solver would be perfect use case might be considerably slower. All logic and search are coded from scratch for transparency and reproducibility.
| Month/Year | Problem/Solution | Language/Method/Approach | Submission | Comments |
|---|---|---|---|---|
| March 2025 | Hall of Mirrors 3 | C++23. Backtracking. Precomputation of integer factorizations. | ✅ Accepted | Runtime: ~1ms |
| April 2025 | Sum One, Somewhere | Analytical solution. | ✅ Accepted | |
| May 2025 | Number Cross 5 | C++23. Backtracking. Lookup tables of all digit displacements. | ✅ Accepted | Runtime: ~10m10s |
| June 2025 | Some Ones, Somewhere | C++23. Backtracking. | 🔶 Partially solved | Solved all partridge tilings. Missed final phrase. Runtime: ~17m. |
| July 2025 | Robot Road Trip | Analytical solution. | ✅ Accepted |