advent-of-code 2025.5.0

Solutions to Advent of Code
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

use crate::input::Input;

type PolymerUnit = u8;

const fn destroys_each_other(a: PolymerUnit, b: PolymerUnit) -> bool {
    a.eq_ignore_ascii_case(&b) && a != b
}

pub fn solve(input: &Input) -> Result<usize, String> {
    let input_polymer = input.text.as_bytes();
    let mut new_polymer = Vec::<PolymerUnit>::with_capacity(input_polymer.len());

    let candidates_for_removal = input.part_values(0..=0, b'a'..=b'z');

    candidates_for_removal
        .map(|to_remove_lower| {
            new_polymer.clear();

            for &unit in input_polymer
                .iter()
                .filter(|unit| !unit.eq_ignore_ascii_case(&to_remove_lower))
            {
                let unit_reacts_with_last = new_polymer
                    .last()
                    .is_some_and(|&last| destroys_each_other(unit, last));

                if unit_reacts_with_last {
                    new_polymer.pop();
                } else {
                    new_polymer.push(unit);
                }
            }

            new_polymer.len()
        })
        .min()
        .ok_or_else(|| "Internal error".to_string())
}

#[test]
fn tests() {
    test_part_one!("aA"=>0);
    test_part_one!("abBA" => 0);
    test_part_one!("abAB" => 4);
    test_part_one!("aabAAB" => 6);

    test_part_two!("dabAcCaCBAcCcaDA" => 4);

    let input = include_str!("day05_input.txt");
    test_part_one!(input => 11252);
    test_part_two!(input => 6118);
}