2023/

directory
v0.0.0-...-13cd2e5 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Dec 22, 2023 License: MIT

Directories

Path Synopsis
Parse each line as game, produce sum of possible game ids and sum of minimum power of minimum cube numbers.
Parse each line as game, produce sum of possible game ids and sum of minimum power of minimum cube numbers.
Find sum of all numbers adjacent (diagonally too) to non '.' characters and sum of all gear ratios (2 numbers adjacent to '*' multiplied).
Find sum of all numbers adjacent (diagonally too) to non '.' characters and sum of all gear ratios (2 numbers adjacent to '*' multiplied).
Find sum of points of winning cards in original deck and count all cards in won cards deck.
Find sum of points of winning cards in original deck and count all cards in won cards deck.
Parse almanac and find lowest seed destination.
Parse almanac and find lowest seed destination.
Find multiplication of record beating attempts for three rides and number of ways to beat final race.
Find multiplication of record beating attempts for three rides and number of ways to beat final race.
Find number of steps from AAA to ZZZ and from all **A to all **Z.
Find number of steps from AAA to ZZZ and from all **A to all **Z.
Find sums of extrapolated history numbers on right and left side of dataset.
Find sums of extrapolated history numbers on right and left side of dataset.
Find half of length of the loop and number of contained tiles in it.
Find half of length of the loop and number of contained tiles in it.
Find sum of valid arrangements of working and non-working springs according to given stencil.
Find sum of valid arrangements of working and non-working springs according to given stencil.
Find reflection line in given pattern either without smudge or with one smudge.
Find reflection line in given pattern either without smudge or with one smudge.
Find board load after tilting north once and after 1000000000 all direction tilts.
Find board load after tilting north once and after 1000000000 all direction tilts.
Find sum of step hashes and sum of lens powers.
Find sum of step hashes and sum of lens powers.
Find number of lightbeam energized tiles, find maximum possible energized tiles possible when starting from any edge tile.
Find number of lightbeam energized tiles, find maximum possible energized tiles possible when starting from any edge tile.
Find most heat-loss eficient path for up to 3 consecutive straight moves and for no less than 4 but up to 10 consecutive straight moves.
Find most heat-loss eficient path for up to 3 consecutive straight moves and for no less than 4 but up to 10 consecutive straight moves.
Find area of polygon given as set of direction + length plotting instructions.
Find area of polygon given as set of direction + length plotting instructions.
Simulate circuit and find number of high and low signals after 1000 button presses; find number of button presses needed to get rx low.
Simulate circuit and find number of high and low signals after 1000 button presses; find number of button presses needed to get rx low.
Find number of covered garden plots given the number of steps.
Find number of covered garden plots given the number of steps.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL