Module aoc_2022::day1

source ·
Expand description

Day 1 consists of counting the number of calories each elf has and finding the max.

Functions

  • Solution however the time complexity could be probably improved. If E is large then the runtime is O(n * E) where n is the length of the input lines
  • From understanding what the max was actually doing is a Binary Heap. Rust as a binary heap impl that I am going to use!