My solutions to Advents of Code in Rust
I use itertools::Itertools which have a nice all_unique (internally, it creates a hashset and insert elements one by one unless it already contains it) but if I really wanted efficiency, I would manage my own hashset because this method is called for each character.
my attempt at advent of code (by Isawan)
for my solution, I used a bitset as an auxillary data structure. The trick is that since chracters are all lower case there's only 26 of them. This means if you use a u32 where each bit is a chracter, you can just OR the slice together and count the number of bits after ORing. https://github.com/Isawan/advent-of-code/blob/master/2022/src/bin/day6-fast.rs
Collect and Analyze Billions of Data Points in Real Time. Manage all types of time series data in a single, purpose-built database. Run at any scale in any environment in the cloud, on-premises, or at the edge.
[All years, all dates] Me after finishing all Advent of Code problems this year (my first year of AoC)
6 projects | /r/adventofcode | 29 Dec 2022
-🎄- 2022 Day 13 Solutions -🎄-
149 projects | /r/adventofcode | 12 Dec 2022
Prawda o Pracy
3 projects | /r/Polska | 12 Nov 2022
[2021 Day 1-25][Rust] Solutions to all of this year's problems in terse and clean Rust
6 projects | /r/adventofcode | 25 Dec 2021
Advent of Code (AoC) Day One
6 projects | dev.to | 1 Dec 2021