Skip to content

HashTag42/AdventOfCode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

AdventOfCode

Solutions to the Advent of Code puzzles


  • My Solution
  • An efficient solution is similar to that in 2021-06 (Lanternfish). Keep a list of buckets for the pairs, calculate the next step per bucket, and multiply the results per the number pairs in each bucket.
  • Fully implemented the .NET IEquatable interface.
  • My Solution
  • Created a 'Point' class. Couldn't find an implementation on the .NET library.
  • My Solution is a C# port of this Python solution.
  • Created a C# 'DefaultDict' class to emulate what 'defaultdict' provides in Python.
  • Created a 'Node' class, including full support for the IEquatable interface.
  • My Solution
  • Created a DumboOctopus class and a DumboOctopusCell derived class.
  • Thought out the problem could be solved using a Queue and no recursion.
  • Designed the algorithm outling using a Excel spreadsheet.
  • My Solution
  • Used recursion to find all locations in a basin.
  • My Solution
  • Used chryptography fundaments to decode the inputs.
  • My Solution
  • The key aspect for an efficient solution is that lanterfishes can be grouped by their number of days left, and the next day calculation needs only to be done on one instance per group.
  • Used the .NET Diagnostics.Stopwatch Class to measure how long it takes to find a solution.



About

Coding challenges

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •