Solutions of some puzzles in Scheme (Lisp), my first experience with it.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Inga 🏳‍🌈 a2475802d6 simplified seed-maps-processor 12 months ago
day01-easy rewritten read-lines with recursion 12 months ago
day01-hard added more tests 12 months ago
day05-easy day 5, part 1 12 months ago
day05-hard simplified seed-maps-processor 12 months ago
.gitignore day 1, part 1 12 months ago
README.md simplified code 12 months ago

README.md

AdventOfCode-2023-functional

Solutions to https://adventofcode.com/2023/

This is my first experience with Lisp, so the code is probably terrible.

Also I decided to reimplement all the mostly basic stuff (like map or reduce) myself, both for fun and because Guile documentation is really bad.

Requirements: Guile 3 in /usr/bin.

In a folder for a specific day,

  • To run (assuming NuShell): open sample.in | ./main.scm;
  • To run (assuming bash): ./main.scm < sample.in.

There are also all solutions in imperative low-level Zig: https://oomza.cutegay.software/inga-lovinde/AdventOfCode-2023