Rust Day 6 - Tidy up; Add tests for correctness

rust/Cargo.toml

@@ -46,3 +46,7 @@ path = "src/day05/main.rs"
 [[bin]]
 name = "day06"
 path = "src/day06/main.rs"
+
+[dependencies]
+# Required for one of the day06 solutions (commented out)
+# phf = { version = "0.11.1", features = ["macros"] }

rust/src/day06/main.rs

@@ -1,17 +1,17 @@
+#![feature(const_mut_refs)]
 #![feature(array_windows)]
-#![cfg_attr(test, feature(test))]
-#![allow(soft_unstable)]
-#![cfg(test)]
+#![feature(test)]
 extern crate test;
 
 const INPUT: &str = include_str!("input.txt");
 
+use solutions::*;
+
 mod part_1;
-use part_1::part_1_vec;
 mod part_2;
-use part_2::part_2_vec;
+mod solutions;
 
 pub fn main() {
-    println!("Part 1: {}", part_1_vec(INPUT));
-    println!("Part 2: {}", part_2_vec(INPUT));
+    println!("Part 1: {}", solve_vertesians_nodeps_const::<4>(INPUT));
+    println!("Part 2: {}", solve_vertesians_nodeps_const::<14>(INPUT));
 }

rust/src/day06/part_1.rs

@@ -1,287 +1,7 @@
-const STRING_SLICE_LENGTH: usize = 4;
-
-pub(crate) fn part_1_vec(input: &'static str) -> usize {
-    for idx in 0..(input.len() - STRING_SLICE_LENGTH) {
-        let mut unique_chars = input[idx..idx + STRING_SLICE_LENGTH]
-            .chars()
-            .collect::<Vec<_>>();
-        unique_chars.sort();
-        unique_chars.dedup();
-        if unique_chars.len() == STRING_SLICE_LENGTH {
-            return idx + STRING_SLICE_LENGTH;
-        }
-    }
-    unreachable!("We should always find an answer");
-}
-
-pub(crate) fn part_1_hashset(input: &'static str) -> usize {
-    for idx in 0..(input.len() - STRING_SLICE_LENGTH) {
-        let unique_chars = input[idx..idx + STRING_SLICE_LENGTH]
-            .chars()
-            .collect::<std::collections::HashSet<_>>();
-        if unique_chars.len() == STRING_SLICE_LENGTH {
-            return idx + STRING_SLICE_LENGTH;
-        }
-    }
-    unreachable!("We should always find an answer");
-}
-
-pub(crate) fn part_1_nicopap_original(input: &'static str) -> usize {
-    nicopap_original::first_sop(input.as_bytes(), STRING_SLICE_LENGTH).unwrap()
-}
-
-mod nicopap_original {
-    fn all_distinct<T: Clone + Ord>(slice: &[T]) -> bool {
-        let mut slice_copy = slice.to_vec();
-        slice_copy.sort_unstable();
-        slice_copy.windows(2).all(|pair| pair[0] != pair[1])
-    }
-    // sop stands for "start of packet"
-    pub(crate) fn first_sop<T: Clone + Ord>(
-        datastream: &[T],
-        required_distinct: usize,
-    ) -> Option<usize> {
-        datastream
-            .windows(required_distinct)
-            .enumerate()
-            .find_map(|(i, slice)| all_distinct(slice).then_some(i + required_distinct))
-    }
-}
-
-pub(crate) fn part_1_nicopap_original_without_windows(input: &'static str) -> usize {
-    let mut cache = Vec::with_capacity(STRING_SLICE_LENGTH);
-    for (i, char) in input.chars().enumerate() {
-        cache.insert(0, char);
-        if cache.len() >= STRING_SLICE_LENGTH {
-            let mut sorted_cache = cache.clone();
-            sorted_cache.sort_unstable();
-            sorted_cache.dedup();
-            if sorted_cache.len() == STRING_SLICE_LENGTH {
-                return i + 1;
-            }
-            cache.pop();
-        }
-    }
-    unreachable!()
-}
-
-pub(crate) fn part_1_nicopap_improved(input: &'static str) -> usize {
-    nicopap_improved::first_sop(input.as_bytes(), STRING_SLICE_LENGTH).unwrap()
-}
-mod nicopap_improved {
-    fn all_distinct<T: Clone + Ord>(slice: &[T], collect_vec: &mut Vec<T>) -> bool {
-        collect_vec.clear();
-        slice.clone_into(collect_vec);
-        collect_vec.sort_unstable();
-        collect_vec.windows(2).all(|pair| pair[0] != pair[1])
-    }
-    // sop stands for "start of packet"
-    pub(crate) fn first_sop<T: Clone + Ord>(
-        datastream: &[T],
-        required_distinct: usize,
-    ) -> Option<usize> {
-        let mut collect_vec = Vec::with_capacity(required_distinct);
-        datastream
-            .windows(required_distinct)
-            .enumerate()
-            .find_map(|(i, slice)| {
-                all_distinct(slice, &mut collect_vec).then_some(i + required_distinct)
-            })
-    }
-}
-
-pub(crate) fn part_1_nicopap_improved_again(input: &'static str) -> usize {
-    nicopap_improved_again::first_sop::<STRING_SLICE_LENGTH>(input.as_bytes()).unwrap()
-}
-mod nicopap_improved_again {
-    struct AlphabetSet(u32);
-    impl AlphabetSet {
-        const fn new() -> Self {
-            Self(0)
-        }
-        /// Add letter to set, return `true` if it is already part of it.
-        /// `symbol` must be an ascii latin alphabet letter.
-        fn add_letter_or_contains(&mut self, symbol: u8) -> bool {
-            let to_set = 1 << (symbol.wrapping_sub(b'a') as u32);
-            let already_set = self.0 & to_set == to_set;
-            self.0 |= to_set;
-            already_set
-        }
-    }
-    fn all_distinct(slice: &[u8]) -> bool {
-        let mut set = AlphabetSet::new();
-        !slice
-            .iter()
-            .any(|letter| set.add_letter_or_contains(*letter))
-    }
-
-    // sop stands for "start of packet"
-    pub(crate) fn first_sop<const W: usize>(datastream: &[u8]) -> Option<usize> {
-        datastream
-            .array_windows::<W>()
-            .enumerate()
-            .find_map(|(i, slice)| all_distinct(slice).then_some(i + W))
-    }
-}
-
-pub(crate) fn part_1_manevillef(input: &'static str) -> usize {
-    manevillef::find_marker(&input.chars().collect::<Vec<_>>(), STRING_SLICE_LENGTH).unwrap()
-}
-
-mod manevillef {
-    use std::collections::HashSet;
-
-    pub(crate) fn find_marker(chars: &[char], window: usize) -> Option<usize> {
-        chars
-            .windows(window)
-            .into_iter()
-            .position(|items| {
-                let set: HashSet<char> = items.iter().copied().collect();
-                set.len() == window
-            })
-            .map(|p| p + window)
-    }
-}
-
-pub fn part_1_snaketwix(input: &'static str) -> usize {
-    let mut number_of_duplicates = 0;
-    let mut char_map = std::collections::HashMap::new();
-    let mut char_deque = std::collections::VecDeque::with_capacity(STRING_SLICE_LENGTH + 1);
-
-    let mut ans = 0;
-
-    for (index, char) in input.char_indices() {
-        let entry = char_map.entry(char).or_insert(0);
-        *entry += 1;
-
-        if *entry > 1 {
-            number_of_duplicates += 1;
-        }
-
-        char_deque.push_back(char);
-
-        if index > STRING_SLICE_LENGTH - 1 {
-            let char = char_deque.pop_front().unwrap();
-
-            // Know that the entry exists, but not sure how to unwrap the entry to get access to the value
-            let entry = char_map.entry(char).or_default();
-            *entry -= 1;
-
-            if *entry >= 1 {
-                number_of_duplicates -= 1;
-            }
-
-            if number_of_duplicates == 0 {
-                ans = index + 1;
-                break;
-            }
-        }
-    }
-
-    ans
-}
-
-pub fn part_1_snaketwix_modified(input: &'static str) -> usize {
-    let mut number_of_duplicates = 0;
-    let mut char_map = std::collections::HashMap::new();
-    let mut char_deque = std::collections::VecDeque::with_capacity(STRING_SLICE_LENGTH + 1);
-
-    let mut ans = 0;
-
-    for (index, char) in input.char_indices() {
-        let entry = char_map.entry(char).or_insert(0);
-        *entry += 1;
-
-        if *entry > 1 {
-            number_of_duplicates += 1;
-        }
-
-        char_deque.push_back(char);
-
-        if index > STRING_SLICE_LENGTH - 1 {
-            let char = char_deque.pop_front().unwrap();
-
-            let entry = match char_map.entry(char) {
-                std::collections::hash_map::Entry::Occupied(entry) => entry.into_mut(),
-                std::collections::hash_map::Entry::Vacant(_) => unreachable!(),
-            };
-            *entry -= 1;
-
-            if *entry >= 1 {
-                number_of_duplicates -= 1;
-            }
-
-            if number_of_duplicates == 0 {
-                ans = index + 1;
-                break;
-            }
-        }
-    }
-
-    ans
-}
-
-fn part_1_harudagondi(input: &'static str) {
-    harudagondi::solve_part1(input);
-}
-
-mod harudagondi {
-    use std::collections::{HashSet, VecDeque};
-
-    #[derive(Default)]
-    struct Solver {
-        buffer: VecDeque<char>,
-        counter: usize,
-        buffer_size: usize,
-    }
-
-    impl Solver {
-        fn new(buffer_size: usize) -> Self {
-            Self {
-                buffer: VecDeque::new(),
-                counter: 0,
-                buffer_size,
-            }
-        }
-
-        fn update(&mut self, c: char) {
-            if self.buffer.len() < self.buffer_size {
-                self.buffer.push_back(c);
-            } else {
-                self.buffer.pop_front();
-                self.buffer.push_back(c);
-            }
-            self.counter += 1;
-        }
-
-        fn starter(&self) -> Option<usize> {
-            let buffer = self.buffer.iter().fold(HashSet::new(), |mut acc, c| {
-                acc.insert(*c);
-                acc
-            });
-
-            if buffer.len() == self.buffer_size {
-                Some(self.counter)
-            } else {
-                None
-            }
-        }
-    }
-
-    pub fn solve_part1(input: &'static str) -> usize {
-        let mut solver = Solver::new(super::STRING_SLICE_LENGTH);
-        for c in input.chars() {
-            solver.update(c);
-            if let Some(counter) = solver.starter() {
-                return counter;
-            }
-        }
-        unreachable!();
-    }
-}
-
 #[cfg(test)]
 mod tests {
+    const WINDOW_SIZE: usize = 4;
+    use crate::solutions::*;
 
     const SAMPLES: [(&str, usize); 5] = [
         (include_str!("sample_inputs/1.txt"), 7),
@@ -291,65 +11,301 @@ mod tests {
         (include_str!("sample_inputs/5.txt"), 11),
     ];
 
-    #[test]
-    fn test_with_solution() {
-        assert_eq!(super::part_1_vec(crate::INPUT), 1723);
+    #[bench]
+    fn bench_vec(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vec::<WINDOW_SIZE>(crate::INPUT));
     }
 
     #[test]
-    fn test_with_sample_solution() {
+    fn test_vec_with_solution() {
+        assert_eq!(solve_vec::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_vec_with_sample_solutions() {
         for (sample_input, sample_answer) in SAMPLES {
-            assert_eq!(super::part_1_vec(sample_input), sample_answer);
+            assert_eq!(solve_vec::<WINDOW_SIZE>(sample_input), sample_answer)
         }
     }
 
     #[bench]
-    fn bench_part_1_vec(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_vec(crate::INPUT));
+    fn bench_hashset(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_hashset::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_hashset_with_solution() {
+        assert_eq!(solve_hashset::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_hashset_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_hashset::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
     }
 
     #[bench]
-    fn bench_part_1_hashset(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_hashset(crate::INPUT));
+    fn bench_snaketwix(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_snaketwix::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_snaketwix_with_solution() {
+        assert_eq!(solve_snaketwix::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_snaketwix_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_snaketwix::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
     }
 
     #[bench]
-    fn bench_part_1_snaketwix(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_snaketwix(crate::INPUT));
+    fn bench_snaketwix_modified(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_snaketwix_modified::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_snaketwix_modified_with_solution() {
+        assert_eq!(solve_snaketwix_modified::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_snaketwix_modified_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_snaketwix_modified::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_1_snaketwix_modified(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_snaketwix_modified(crate::INPUT));
+    fn bench_nicopap_original(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_original::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_nicopap_original_with_solution() {
+        assert_eq!(solve_nicopap_original::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_nicopap_original_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_original::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
+    }
+    #[bench]
+    fn bench_nicopap_original_without_windows(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_original_without_windows::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_nicopap_original_without_windows_with_solution() {
+        assert_eq!(
+            solve_nicopap_original_without_windows::<WINDOW_SIZE>(crate::INPUT),
+            1723
+        )
+    }
+
+    #[test]
+    fn test_nicopap_original_without_windows_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_original_without_windows::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_1_nicopap_original(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_nicopap_original(crate::INPUT));
+    fn bench_nicopap_improved(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_improved::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_nicopap_improved_with_solution() {
+        assert_eq!(solve_nicopap_improved::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_nicopap_improved_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_improved::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_1_nicopap_original_without_windows(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_nicopap_original_without_windows(crate::INPUT));
+    fn bench_nicopap_improved_again(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_improved_again::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_nicopap_improved_again_with_solution() {
+        assert_eq!(
+            solve_nicopap_improved_again::<WINDOW_SIZE>(crate::INPUT),
+            1723
+        )
+    }
+
+    #[test]
+    fn test_nicopap_improved_again_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_improved_again::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_1_nicopap_improved(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_nicopap_improved(crate::INPUT));
+    fn bench_manevillef(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_manevillef::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_manevillef_with_solution() {
+        assert_eq!(solve_manevillef::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_manevillef_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_manevillef::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
     }
 
     #[bench]
-    fn bench_part_1_nicopap_improved_again(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_nicopap_improved_again(crate::INPUT));
+    fn bench_manevillef_again(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_manevillef_again::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_manevillef_again_with_solution() {
+        assert_eq!(solve_manevillef_again::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_manevillef_again_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_manevillef_again::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_1_manevillef(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_manevillef(crate::INPUT));
+    fn bench_harudagondi(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_harudagondi::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_harudagondi_with_solution() {
+        assert_eq!(solve_harudagondi::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_harudagondi_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_harudagondi::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
+    }
+
+    /* Requires phf crate
+    #[bench]
+    fn bench_vertesians(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_with_solution() {
+        assert_eq!(solve_vertesians::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_vertesians_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_vertesians::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
+    }
+     */
+
+    #[bench]
+    fn bench_vertesians_nodeps(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians_nodeps::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_with_solution() {
+        assert_eq!(solve_vertesians_nodeps::<WINDOW_SIZE>(crate::INPUT), 1723)
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_vertesians_nodeps::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_1_harudagondi(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_1_harudagondi(crate::INPUT));
+    fn bench_vertesians_nodeps_improved(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians_nodeps_improved::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_improved_with_solution() {
+        assert_eq!(
+            solve_vertesians_nodeps_improved::<WINDOW_SIZE>(crate::INPUT),
+            1723
+        )
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_improved_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_vertesians_nodeps_improved::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
+    }
+
+    #[bench]
+    fn bench_vertesians_nodeps_const(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians_nodeps_const::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_const_with_solution() {
+        assert_eq!(
+            solve_vertesians_nodeps_const::<WINDOW_SIZE>(crate::INPUT),
+            1723
+        )
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_const_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_vertesians_nodeps_const::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 }

rust/src/day06/part_2.rs

@@ -1,289 +1,8 @@
-const STRING_SLICE_LENGTH: usize = 14;
-
-pub(crate) fn part_2_vec(input: &'static str) -> usize {
-    for idx in 0..(input.len() - STRING_SLICE_LENGTH) {
-        let mut unique_chars = input[idx..idx + STRING_SLICE_LENGTH]
-            .chars()
-            .collect::<Vec<_>>();
-        unique_chars.sort();
-        unique_chars.dedup();
-        if unique_chars.len() == STRING_SLICE_LENGTH {
-            return idx + STRING_SLICE_LENGTH;
-        }
-    }
-    unreachable!("We should always find an answer");
-}
-
-pub(crate) fn part_2_hashset(input: &'static str) -> usize {
-    for idx in 0..(input.len() - STRING_SLICE_LENGTH) {
-        let unique_chars = input[idx..idx + STRING_SLICE_LENGTH]
-            .chars()
-            .collect::<std::collections::HashSet<_>>();
-        if unique_chars.len() == STRING_SLICE_LENGTH {
-            return idx + STRING_SLICE_LENGTH;
-        }
-    }
-    unreachable!("We should always find an answer");
-}
-
-pub(crate) fn part_2_nicopap_original(input: &'static str) -> usize {
-    nicopap_original::first_sop(input.as_bytes(), STRING_SLICE_LENGTH).unwrap()
-}
-
-mod nicopap_original {
-    fn all_distinct<T: Clone + Ord>(slice: &[T]) -> bool {
-        let mut slice_copy = slice.to_vec();
-        slice_copy.sort_unstable();
-        slice_copy.windows(2).all(|pair| pair[0] != pair[1])
-    }
-    // sop stands for "start of packet"
-    pub(crate) fn first_sop<T: Clone + Ord>(
-        datastream: &[T],
-        required_distinct: usize,
-    ) -> Option<usize> {
-        datastream
-            .windows(required_distinct)
-            .enumerate()
-            .find_map(|(i, slice)| all_distinct(slice).then_some(i + required_distinct))
-    }
-}
-
-pub(crate) fn part_2_nicopap_original_without_windows(input: &'static str) -> usize {
-    let mut cache = Vec::with_capacity(STRING_SLICE_LENGTH);
-    for (i, char) in input.chars().enumerate() {
-        cache.insert(0, char);
-        if cache.len() >= STRING_SLICE_LENGTH {
-            let mut sorted_cache = cache.clone();
-            sorted_cache.sort_unstable();
-            sorted_cache.dedup();
-            if sorted_cache.len() == STRING_SLICE_LENGTH {
-                return i + 1;
-            }
-            cache.pop();
-        }
-    }
-    unreachable!()
-}
-
-pub(crate) fn part_2_nicopap_improved(input: &'static str) -> usize {
-    nicopap_improved::first_sop(input.as_bytes(), STRING_SLICE_LENGTH).unwrap()
-}
-
-mod nicopap_improved {
-    fn all_distinct<T: Clone + Ord>(slice: &[T], collect_vec: &mut Vec<T>) -> bool {
-        collect_vec.clear();
-        slice.clone_into(collect_vec);
-        collect_vec.sort_unstable();
-        collect_vec.windows(2).all(|pair| pair[0] != pair[1])
-    }
-    // sop stands for "start of packet"
-    pub(crate) fn first_sop<T: Clone + Ord>(
-        datastream: &[T],
-        required_distinct: usize,
-    ) -> Option<usize> {
-        let mut collect_vec = Vec::with_capacity(required_distinct);
-        datastream
-            .windows(required_distinct)
-            .enumerate()
-            .find_map(|(i, slice)| {
-                all_distinct(slice, &mut collect_vec).then_some(i + required_distinct)
-            })
-    }
-}
-
-pub(crate) fn part_2_nicopap_improved_again(input: &'static str) -> usize {
-    nicopap_improved_again::first_sop::<STRING_SLICE_LENGTH>(input.as_bytes()).unwrap()
-}
-
-mod nicopap_improved_again {
-    struct AlphabetSet(u32);
-    impl AlphabetSet {
-        const fn new() -> Self {
-            Self(0)
-        }
-        /// Add letter to set, return `true` if it is already part of it.
-        /// `symbol` must be an ascii latin alphabet letter.
-        fn add_letter_or_contains(&mut self, symbol: u8) -> bool {
-            let to_set = 1 << (symbol.wrapping_sub(b'a') as u32);
-            let already_set = self.0 & to_set == to_set;
-            self.0 |= to_set;
-            already_set
-        }
-    }
-    fn all_distinct(slice: &[u8]) -> bool {
-        let mut set = AlphabetSet::new();
-        !slice
-            .iter()
-            .any(|letter| set.add_letter_or_contains(*letter))
-    }
-
-    // sop stands for "start of packet"
-    pub(crate) fn first_sop<const W: usize>(datastream: &[u8]) -> Option<usize> {
-        datastream
-            .array_windows::<W>()
-            .enumerate()
-            .find_map(|(i, slice)| all_distinct(slice).then_some(i + W))
-    }
-}
-
-pub(crate) fn part_2_manevillef(input: &'static str) -> usize {
-    manevillef::find_marker(&input.chars().collect::<Vec<_>>(), STRING_SLICE_LENGTH).unwrap()
-}
-
-mod manevillef {
-    use std::collections::HashSet;
-
-    pub(crate) fn find_marker(chars: &[char], window: usize) -> Option<usize> {
-        chars
-            .windows(window)
-            .into_iter()
-            .position(|items| {
-                let set: HashSet<char> = items.iter().copied().collect();
-                set.len() == window
-            })
-            .map(|p| p + window)
-    }
-}
-
-pub fn part_2_snaketwix(input: &'static str) -> usize {
-    let mut number_of_duplicates = 0;
-    let mut char_map = std::collections::HashMap::new();
-    let mut char_deque = std::collections::VecDeque::with_capacity(STRING_SLICE_LENGTH + 1);
-
-    let mut ans = 0;
-
-    for (index, char) in input.char_indices() {
-        let entry = char_map.entry(char).or_insert(0);
-        *entry += 1;
-
-        if *entry > 1 {
-            number_of_duplicates += 1;
-        }
-
-        char_deque.push_back(char);
-
-        if index > STRING_SLICE_LENGTH - 1 {
-            let char = char_deque.pop_front().unwrap();
-
-            // Know that the entry exists, but not sure how to unwrap the entry to get access to the value
-            let entry = char_map.entry(char).or_default();
-            *entry -= 1;
-
-            if *entry >= 1 {
-                number_of_duplicates -= 1;
-            }
-
-            if number_of_duplicates == 0 {
-                ans = index + 1;
-                break;
-            }
-        }
-    }
-
-    ans
-}
-
-pub fn part_2_snaketwix_modified(input: &'static str) -> usize {
-    let mut number_of_duplicates = 0;
-    let mut char_map = std::collections::HashMap::new();
-    let mut char_deque = std::collections::VecDeque::with_capacity(STRING_SLICE_LENGTH + 1);
-
-    let mut ans = 0;
-
-    for (index, char) in input.char_indices() {
-        let entry = char_map.entry(char).or_insert(0);
-        *entry += 1;
-
-        if *entry > 1 {
-            number_of_duplicates += 1;
-        }
-
-        char_deque.push_back(char);
-
-        if index > STRING_SLICE_LENGTH - 1 {
-            let char = char_deque.pop_front().unwrap();
-
-            let entry = match char_map.entry(char) {
-                std::collections::hash_map::Entry::Occupied(entry) => entry.into_mut(),
-                std::collections::hash_map::Entry::Vacant(_) => unreachable!(),
-            };
-            *entry -= 1;
-
-            if *entry >= 1 {
-                number_of_duplicates -= 1;
-            }
-
-            if number_of_duplicates == 0 {
-                ans = index + 1;
-                break;
-            }
-        }
-    }
-
-    ans
-}
-
-fn part_2_harudagondi(input: &'static str) {
-    harudagondi::solve_part2(input);
-}
-
-mod harudagondi {
-    use std::collections::{HashSet, VecDeque};
-
-    #[derive(Default)]
-    struct Solver {
-        buffer: VecDeque<char>,
-        counter: usize,
-        buffer_size: usize,
-    }
-
-    impl Solver {
-        fn new(buffer_size: usize) -> Self {
-            Self {
-                buffer: VecDeque::new(),
-                counter: 0,
-                buffer_size,
-            }
-        }
-
-        fn update(&mut self, c: char) {
-            if self.buffer.len() < self.buffer_size {
-                self.buffer.push_back(c);
-            } else {
-                self.buffer.pop_front();
-                self.buffer.push_back(c);
-            }
-            self.counter += 1;
-        }
-
-        fn starter(&self) -> Option<usize> {
-            let buffer = self.buffer.iter().fold(HashSet::new(), |mut acc, c| {
-                acc.insert(*c);
-                acc
-            });
-
-            if buffer.len() == self.buffer_size {
-                Some(self.counter)
-            } else {
-                None
-            }
-        }
-    }
-
-    pub fn solve_part2(input: &'static str) -> usize {
-        let mut solver = Solver::new(super::STRING_SLICE_LENGTH);
-        for c in input.chars() {
-            solver.update(c);
-            if let Some(counter) = solver.starter() {
-                return counter;
-            }
-        }
-        unreachable!();
-    }
-}
-
 #[cfg(test)]
 mod tests {
+    const WINDOW_SIZE: usize = 14;
+    use crate::solutions::*;
+
     const SAMPLES: [(&str, usize); 5] = [
         (include_str!("sample_inputs/1.txt"), 19),
         (include_str!("sample_inputs/2.txt"), 23),
@@ -292,64 +11,301 @@ mod tests {
         (include_str!("sample_inputs/5.txt"), 26),
     ];
 
-    #[test]
-    fn test_with_solution() {
-        assert_eq!(super::part_2_vec(crate::INPUT), 3708);
+    #[bench]
+    fn bench_vec(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vec::<WINDOW_SIZE>(crate::INPUT));
     }
 
     #[test]
-    fn test_with_sample_solution() {
+    fn test_vec_with_solution() {
+        assert_eq!(solve_vec::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_vec_with_sample_solutions() {
         for (sample_input, sample_answer) in SAMPLES {
-            assert_eq!(super::part_2_vec(sample_input), sample_answer);
+            assert_eq!(solve_vec::<WINDOW_SIZE>(sample_input), sample_answer)
         }
     }
 
     #[bench]
-    fn bench_part_2_vec(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_vec(crate::INPUT));
+    fn bench_hashset(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_hashset::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_hashset_with_solution() {
+        assert_eq!(solve_hashset::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_hashset_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_hashset::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
     }
 
     #[bench]
-    fn bench_part_2_hashset(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_hashset(crate::INPUT));
+    fn bench_snaketwix(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_snaketwix::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_snaketwix_with_solution() {
+        assert_eq!(solve_snaketwix::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_snaketwix_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_snaketwix::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
     }
 
     #[bench]
-    fn bench_part_2_snaketwix(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_snaketwix(crate::INPUT));
+    fn bench_snaketwix_modified(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_snaketwix_modified::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_snaketwix_modified_with_solution() {
+        assert_eq!(solve_snaketwix_modified::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_snaketwix_modified_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_snaketwix_modified::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_2_snaketwix_modified(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_snaketwix_modified(crate::INPUT));
+    fn bench_nicopap_original(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_original::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_nicopap_original_with_solution() {
+        assert_eq!(solve_nicopap_original::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_nicopap_original_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_original::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
+    }
+    #[bench]
+    fn bench_nicopap_original_without_windows(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_original_without_windows::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_nicopap_original_without_windows_with_solution() {
+        assert_eq!(
+            solve_nicopap_original_without_windows::<WINDOW_SIZE>(crate::INPUT),
+            3708
+        )
+    }
+
+    #[test]
+    fn test_nicopap_original_without_windows_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_original_without_windows::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_2_nicopap_original(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_nicopap_original(crate::INPUT));
+    fn bench_nicopap_improved(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_improved::<WINDOW_SIZE>(crate::INPUT));
     }
-    #[bench]
-    fn bench_part_2_nicopap_original_without_windows(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_nicopap_original_without_windows(crate::INPUT));
+
+    #[test]
+    fn test_nicopap_improved_with_solution() {
+        assert_eq!(solve_nicopap_improved::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_nicopap_improved_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_improved::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_2_nicopap_improved(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_nicopap_improved(crate::INPUT));
+    fn bench_nicopap_improved_again(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_nicopap_improved_again::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_nicopap_improved_again_with_solution() {
+        assert_eq!(
+            solve_nicopap_improved_again::<WINDOW_SIZE>(crate::INPUT),
+            3708
+        )
+    }
+
+    #[test]
+    fn test_nicopap_improved_again_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_nicopap_improved_again::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_2_nicopap_improved_again(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_nicopap_improved_again(crate::INPUT));
+    fn bench_manevillef(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_manevillef::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_manevillef_with_solution() {
+        assert_eq!(solve_manevillef::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_manevillef_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_manevillef::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
     }
 
     #[bench]
-    fn bench_part_2_manevillef(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_manevillef(crate::INPUT));
+    fn bench_manevillef_again(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_manevillef_again::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_manevillef_again_with_solution() {
+        assert_eq!(solve_manevillef_again::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_manevillef_again_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_manevillef_again::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 
     #[bench]
-    fn bench_part_2_harudagondi(bencher: &mut test::Bencher) {
-        bencher.iter(|| super::part_2_harudagondi(crate::INPUT));
+    fn bench_harudagondi(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_harudagondi::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_harudagondi_with_solution() {
+        assert_eq!(solve_harudagondi::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_harudagondi_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_harudagondi::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
+    }
+
+    /* Requires phf crate
+    #[bench]
+    fn bench_vertesians(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_with_solution() {
+        assert_eq!(solve_vertesians::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_vertesians_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(solve_vertesians::<WINDOW_SIZE>(sample_input), sample_answer)
+        }
+    }
+     */
+
+    #[bench]
+    fn bench_vertesians_nodeps(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians_nodeps::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_with_solution() {
+        assert_eq!(solve_vertesians_nodeps::<WINDOW_SIZE>(crate::INPUT), 3708)
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_vertesians_nodeps::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
+    }
+
+    #[bench]
+    fn bench_vertesians_nodeps_improved(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians_nodeps_improved::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_improved_with_solution() {
+        assert_eq!(
+            solve_vertesians_nodeps_improved::<WINDOW_SIZE>(crate::INPUT),
+            3708
+        )
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_improved_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_vertesians_nodeps_improved::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
+    }
+
+    #[bench]
+    fn bench_vertesians_nodeps_const(bencher: &mut test::Bencher) {
+        bencher.iter(|| solve_vertesians_nodeps_const::<WINDOW_SIZE>(crate::INPUT));
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_const_with_solution() {
+        assert_eq!(
+            solve_vertesians_nodeps_const::<WINDOW_SIZE>(crate::INPUT),
+            3708
+        )
+    }
+
+    #[test]
+    fn test_vertesians_nodeps_const_with_sample_solutions() {
+        for (sample_input, sample_answer) in SAMPLES {
+            assert_eq!(
+                solve_vertesians_nodeps_const::<WINDOW_SIZE>(sample_input),
+                sample_answer
+            )
+        }
     }
 }

rust/src/day06/solutions.rs

@@ -0,0 +1,528 @@
+#![allow(dead_code)]
+
+// My original solution
+pub(crate) fn solve_vec<const N: usize>(input: &'static str) -> usize {
+    for idx in 0..(input.len() - N) {
+        let mut unique_chars = input[idx..idx + N].chars().collect::<Vec<_>>();
+        unique_chars.sort();
+        unique_chars.dedup();
+        if unique_chars.len() == N {
+            return idx + N;
+        }
+    }
+    unreachable!("We should always find an answer");
+}
+
+pub(crate) fn solve_hashset<const N: usize>(input: &'static str) -> usize {
+    for idx in 0..(input.len() - N) {
+        let unique_chars = input[idx..idx + N]
+            .chars()
+            .collect::<std::collections::HashSet<_>>();
+        if unique_chars.len() == N {
+            return idx + N;
+        }
+    }
+    unreachable!("We should always find an answer");
+}
+
+pub(crate) fn solve_nicopap_original<const N: usize>(input: &'static str) -> usize {
+    nicopap_original::first_sop(input.as_bytes(), N).unwrap()
+}
+
+mod nicopap_original {
+    fn all_distinct<T: Clone + Ord>(slice: &[T]) -> bool {
+        let mut slice_copy = slice.to_vec();
+        slice_copy.sort_unstable();
+        slice_copy.windows(2).all(|pair| pair[0] != pair[1])
+    }
+    // sop stands for "start of packet"
+    pub(crate) fn first_sop<T: Clone + Ord>(
+        datastream: &[T],
+        required_distinct: usize,
+    ) -> Option<usize> {
+        datastream
+            .windows(required_distinct)
+            .enumerate()
+            .find_map(|(i, slice)| all_distinct(slice).then_some(i + required_distinct))
+    }
+}
+
+pub(crate) fn solve_nicopap_original_without_windows<const N: usize>(input: &'static str) -> usize {
+    let mut cache = Vec::with_capacity(N);
+    for (i, char) in input.chars().enumerate() {
+        cache.insert(0, char);
+        if cache.len() >= N {
+            let mut sorted_cache = cache.clone();
+            sorted_cache.sort_unstable();
+            sorted_cache.dedup();
+            if sorted_cache.len() == N {
+                return i + 1;
+            }
+            cache.pop();
+        }
+    }
+    unreachable!()
+}
+
+pub(crate) fn solve_nicopap_improved<const N: usize>(input: &'static str) -> usize {
+    nicopap_improved::first_sop(input.as_bytes(), N).unwrap()
+}
+
+mod nicopap_improved {
+    fn all_distinct<T: Clone + Ord>(slice: &[T], collect_vec: &mut Vec<T>) -> bool {
+        collect_vec.clear();
+        slice.clone_into(collect_vec);
+        collect_vec.sort_unstable();
+        collect_vec.windows(2).all(|pair| pair[0] != pair[1])
+    }
+    // sop stands for "start of packet"
+    pub(crate) fn first_sop<T: Clone + Ord>(
+        datastream: &[T],
+        required_distinct: usize,
+    ) -> Option<usize> {
+        let mut collect_vec = Vec::with_capacity(required_distinct);
+        datastream
+            .windows(required_distinct)
+            .enumerate()
+            .find_map(|(i, slice)| {
+                all_distinct(slice, &mut collect_vec).then_some(i + required_distinct)
+            })
+    }
+}
+
+pub(crate) fn solve_nicopap_improved_again<const N: usize>(input: &'static str) -> usize {
+    nicopap_improved_again::first_sop::<N>(input.as_bytes()).unwrap()
+}
+
+mod nicopap_improved_again {
+    struct AlphabetSet(u32);
+    impl AlphabetSet {
+        const fn new() -> Self {
+            Self(0)
+        }
+        /// Add letter to set, return `true` if it is already part of it.
+        /// `symbol` must be an ascii latin alphabet letter.
+        fn add_letter_or_contains(&mut self, symbol: u8) -> bool {
+            let to_set = 1 << (symbol.wrapping_sub(b'a') as u32);
+            let already_set = self.0 & to_set == to_set;
+            self.0 |= to_set;
+            already_set
+        }
+    }
+    fn all_distinct(slice: &[u8]) -> bool {
+        let mut set = AlphabetSet::new();
+        !slice
+            .iter()
+            .any(|letter| set.add_letter_or_contains(*letter))
+    }
+
+    // sop stands for "start of packet"
+    pub(crate) fn first_sop<const W: usize>(datastream: &[u8]) -> Option<usize> {
+        datastream
+            .array_windows::<W>()
+            .enumerate()
+            .find_map(|(i, slice)| all_distinct(slice).then_some(i + W))
+    }
+}
+
+pub(crate) fn solve_manevillef<const N: usize>(input: &'static str) -> usize {
+    manevillef::find_marker(&input.chars().collect::<Vec<_>>(), N).unwrap()
+}
+
+mod manevillef {
+    use std::collections::HashSet;
+
+    pub(crate) fn find_marker(chars: &[char], window: usize) -> Option<usize> {
+        chars
+            .windows(window)
+            .into_iter()
+            .position(|items| {
+                let set: HashSet<char> = items.iter().copied().collect();
+                set.len() == window
+            })
+            .map(|p| p + window)
+    }
+}
+
+pub(crate) fn solve_manevillef_again<const N: usize>(input: &'static str) -> usize {
+    let bytes = input.as_bytes();
+    let mut cache = bytes[..N].to_owned();
+    for (i, byte) in bytes[N..].iter().enumerate() {
+        let mut sorted = cache.clone();
+        sorted.sort_unstable();
+        sorted.dedup();
+        if sorted.len() == N {
+            return i + N;
+        }
+        cache.rotate_left(1);
+        cache[N - 1] = *byte;
+    }
+    unreachable!()
+}
+
+pub fn solve_snaketwix<const N: usize>(input: &'static str) -> usize {
+    let mut number_of_duplicates = 0;
+    let mut char_map = std::collections::HashMap::new();
+    let mut char_deque = std::collections::VecDeque::with_capacity(N + 1);
+
+    let mut ans = 0;
+
+    for (index, char) in input.char_indices() {
+        let entry = char_map.entry(char).or_insert(0);
+        *entry += 1;
+
+        if *entry > 1 {
+            number_of_duplicates += 1;
+        }
+
+        char_deque.push_back(char);
+
+        if index > N - 1 {
+            let char = char_deque.pop_front().unwrap();
+
+            // Know that the entry exists, but not sure how to unwrap the entry to get access to the value
+            let entry = char_map.entry(char).or_default();
+            *entry -= 1;
+
+            if *entry >= 1 {
+                number_of_duplicates -= 1;
+            }
+
+            if number_of_duplicates == 0 {
+                ans = index + 1;
+                break;
+            }
+        }
+    }
+
+    ans
+}
+
+pub fn solve_snaketwix_modified<const N: usize>(input: &'static str) -> usize {
+    let mut number_of_duplicates = 0;
+    let mut char_map = std::collections::HashMap::new();
+    let mut char_deque = std::collections::VecDeque::with_capacity(N + 1);
+
+    let mut ans = 0;
+
+    for (index, char) in input.char_indices() {
+        let entry = char_map.entry(char).or_insert(0);
+        *entry += 1;
+
+        if *entry > 1 {
+            number_of_duplicates += 1;
+        }
+
+        char_deque.push_back(char);
+
+        if index > N - 1 {
+            let char = char_deque.pop_front().unwrap();
+
+            let entry = match char_map.entry(char) {
+                std::collections::hash_map::Entry::Occupied(entry) => entry.into_mut(),
+                std::collections::hash_map::Entry::Vacant(_) => unreachable!(),
+            };
+            *entry -= 1;
+
+            if *entry >= 1 {
+                number_of_duplicates -= 1;
+            }
+
+            if number_of_duplicates == 0 {
+                ans = index + 1;
+                break;
+            }
+        }
+    }
+
+    ans
+}
+
+pub fn solve_harudagondi<const N: usize>(input: &'static str) -> usize {
+    harudagondi::solve_part2::<N>(input)
+}
+
+mod harudagondi {
+    use std::collections::{HashSet, VecDeque};
+
+    #[derive(Default)]
+    struct Solver {
+        buffer: VecDeque<char>,
+        counter: usize,
+        buffer_size: usize,
+    }
+
+    impl Solver {
+        fn new(buffer_size: usize) -> Self {
+            Self {
+                buffer: VecDeque::new(),
+                counter: 0,
+                buffer_size,
+            }
+        }
+
+        fn update(&mut self, c: char) {
+            if self.buffer.len() < self.buffer_size {
+                self.buffer.push_back(c);
+            } else {
+                self.buffer.pop_front();
+                self.buffer.push_back(c);
+            }
+            self.counter += 1;
+        }
+
+        fn starter(&self) -> Option<usize> {
+            let buffer = self.buffer.iter().fold(HashSet::new(), |mut acc, c| {
+                acc.insert(*c);
+                acc
+            });
+
+            if buffer.len() == self.buffer_size {
+                Some(self.counter)
+            } else {
+                None
+            }
+        }
+    }
+
+    pub fn solve_part2<const N: usize>(input: &'static str) -> usize {
+        let mut solver = Solver::new(N);
+        for c in input.chars() {
+            solver.update(c);
+            if let Some(counter) = solver.starter() {
+                return counter;
+            }
+        }
+        unreachable!();
+    }
+}
+
+/* Requires phf crate
+pub fn solve_vertesians<const N: usize>(input: &'static str) -> usize {
+    vertesians::main::<N>(input)
+}
+
+mod vertesians {
+    pub(super) fn main<const N: usize>(input: &'static str) -> usize {
+        let data = input
+            .chars()
+            .map(|c| *SYMBOL_MAP.get(&c).expect("Invalid characters in input"))
+            .collect::<Vec<u32>>();
+
+        assert!(!data.is_empty(), "Received empty input");
+
+        process::<N>(data)
+    }
+
+    fn process<const N: usize>(data: Vec<u32>) -> usize {
+        let mut counter = 0;
+
+        loop {
+            let combined = {
+                let mut combined = 0;
+
+                for i in 0..N {
+                    combined |= data[counter + i];
+                }
+
+                combined
+            };
+
+            if check::<N>(combined) {
+                return counter + N;
+            } else {
+                counter += 1;
+            }
+        }
+    }
+
+    static SYMBOL_MAP: phf::Map<char, u32> = phf::phf_map! {
+        'a' => 0b0000_0000_0000_0000_0000_0000_0000_0001,
+        'b' => 0b0000_0000_0000_0000_0000_0000_0000_0010,
+        'c' => 0b0000_0000_0000_0000_0000_0000_0000_0100,
+        'd' => 0b0000_0000_0000_0000_0000_0000_0000_1000,
+        'e' => 0b0000_0000_0000_0000_0000_0000_0001_0000,
+        'f' => 0b0000_0000_0000_0000_0000_0000_0010_0000,
+        'g' => 0b0000_0000_0000_0000_0000_0000_0100_0000,
+        'h' => 0b0000_0000_0000_0000_0000_0000_1000_0000,
+        'i' => 0b0000_0000_0000_0000_0000_0001_0000_0000,
+        'j' => 0b0000_0000_0000_0000_0000_0010_0000_0000,
+        'k' => 0b0000_0000_0000_0000_0000_0100_0000_0000,
+        'l' => 0b0000_0000_0000_0000_0000_1000_0000_0000,
+        'm' => 0b0000_0000_0000_0000_0001_0000_0000_0000,
+        'n' => 0b0000_0000_0000_0000_0010_0000_0000_0000,
+        'o' => 0b0000_0000_0000_0000_0100_0000_0000_0000,
+        'p' => 0b0000_0000_0000_0000_1000_0000_0000_0000,
+        'q' => 0b0000_0000_0000_0001_0000_0000_0000_0000,
+        'r' => 0b0000_0000_0000_0010_0000_0000_0000_0000,
+        's' => 0b0000_0000_0000_0100_0000_0000_0000_0000,
+        't' => 0b0000_0000_0000_1000_0000_0000_0000_0000,
+        'u' => 0b0000_0000_0001_0000_0000_0000_0000_0000,
+        'v' => 0b0000_0000_0010_0000_0000_0000_0000_0000,
+        'w' => 0b0000_0000_0100_0000_0000_0000_0000_0000,
+        'x' => 0b0000_0000_1000_0000_0000_0000_0000_0000,
+        'y' => 0b0000_0001_0000_0000_0000_0000_0000_0000,
+        'z' => 0b0000_0010_0000_0000_0000_0000_0000_0000,
+    };
+
+    fn check<const N: usize>(combined: u32) -> bool {
+        let mut flipped_count = 0;
+
+        for position in 0..26 {
+            let filtered = combined & !(1 << position);
+
+            if filtered != combined {
+                flipped_count += 1;
+            }
+
+            if flipped_count == N {
+                return true;
+            }
+        }
+
+        false
+    }
+}
+*/
+
+pub fn solve_vertesians_nodeps<const N: usize>(input: &'static str) -> usize {
+    vertesians_nodeps::main::<N>(input)
+}
+
+mod vertesians_nodeps {
+    pub(super) fn main<const N: usize>(input: &'static str) -> usize {
+        let data = input
+            .chars()
+            .map(|c| 1 << (c as u32 - 0x61))
+            .collect::<Vec<u32>>();
+
+        assert!(!data.is_empty(), "Received empty input");
+
+        process::<N>(data)
+    }
+
+    fn process<const N: usize>(data: Vec<u32>) -> usize {
+        let mut counter = 0;
+
+        loop {
+            let combined = {
+                let mut combined = 0;
+
+                for i in 0..N {
+                    combined |= data[counter + i];
+                }
+
+                combined
+            };
+
+            if check::<N>(combined) {
+                return counter + N;
+            } else {
+                counter += 1;
+            }
+        }
+    }
+
+    fn check<const N: usize>(combined: u32) -> bool {
+        let mut flipped_count = 0;
+
+        for position in 0..26 {
+            let filtered = combined & !(1 << position);
+
+            if filtered != combined {
+                flipped_count += 1;
+            }
+
+            if flipped_count == N {
+                return true;
+            }
+        }
+
+        false
+    }
+}
+
+pub fn solve_vertesians_nodeps_improved<const N: usize>(input: &'static str) -> usize {
+    vertesians_nodeps_improved::main::<N>(input)
+}
+
+mod vertesians_nodeps_improved {
+    pub(super) fn main<const N: usize>(input: &'static str) -> usize {
+        let data = input
+            .chars()
+            .map(|c| 1 << (c as u32 - 0x61))
+            .collect::<Vec<u32>>();
+
+        assert!(!data.is_empty(), "Received empty input");
+
+        process::<N>(data)
+    }
+
+    fn process<const N: usize>(data: Vec<u32>) -> usize {
+        let mut counter = 0;
+
+        loop {
+            let combined = {
+                let mut combined = 0;
+
+                for i in 0..N {
+                    combined |= data[counter + i];
+                }
+
+                combined
+            };
+
+            // Thanks to Gibonius for the suggestion to use u32::count_ones()
+            if (combined & u32::MAX).count_ones() == N as u32 {
+                return counter + N;
+            } else {
+                counter += 1;
+            }
+        }
+    }
+}
+
+pub const fn solve_vertesians_nodeps_const<const N: usize>(input: &'static str) -> usize {
+    // For 0ns results
+    // match N {
+    //     4 => nicopap_vertesians_const::RESULT_PART_1,
+    //     14 => nicopap_vertesians_const::RESULT_PART_2,
+    //     _ => unreachable!(),
+    // }
+    nicopap_vertesians_const::process::<N>(input.as_bytes())
+}
+
+mod nicopap_vertesians_const {
+    pub(super) const RESULT_PART_1: usize = process::<4>(include_bytes!("./input.txt"));
+    pub(super) const RESULT_PART_2: usize = process::<14>(include_bytes!("./input.txt"));
+
+    pub(super) const fn process<const N: usize>(data: &'static [u8]) -> usize {
+        let mut counter = 0;
+
+        loop {
+            let combined = {
+                let mut combined = 0;
+                let mut i = 0;
+                loop {
+                    if i == N {
+                        break;
+                    }
+                    combined |= 1 << (data[counter + i] - b'a') as u32;
+                    i += 1;
+                }
+                combined
+            };
+
+            if check::<N>(combined) {
+                return counter + N;
+            } else {
+                counter += 1;
+            }
+        }
+    }
+
+    const fn check<const N: usize>(combined: u32) -> bool {
+        let flipped_count = (combined & 0b11_1111_1111_1111_1111_1111_1111).count_ones();
+        flipped_count == (N as u32)
+    }
+}