inga-lovinde
/
AdventOfCode-2023-functional
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
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.
15 Commits
1 Branch
0 Tags
734 KiB
 
Tag: Branch: Tree: 5ed8b1729e
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '5ed8b1729e'
${ noResults }
Inga 🏳‍🌈 5ed8b1729e
day 1, part 2 (doesn't actually work because I misunderstood requirements) 		1 year ago
day01-easy rewritten read-lines with recursion 1 year ago
day01-hard day 1, part 2 (doesn't actually work because I misunderstood requirements) 1 year ago
.gitignore day 1, part 1 1 year ago
README.md link to zig solutions 1 year 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.

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