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
53
54
55
56
57
58
59
60
61
62

//! # Day 6: Signals and Noise
//!
//! Something is jamming your communications with Santa. Fortunately, your signal is only partially
//! jammed, and protocol in situations like this is to switch to a simple [repetition code] to get
//! the message through.
//!
//! In this model, the same message is sent repeatedly. You've recorded the repeating message signal
//! (your puzzle input), but the data seems quite corrupted - almost too badly to recover.
//! **Almost**.
//!
//! All you need to do is figure out which character is most frequent for each position. For
//! example, suppose you had recorded the following messages:
//!
//! ```txt
//! eedadn
//! drvtee
//! eandsr
//! raavrd
//! atevrs
//! tsrnev
//! sdttsa
//! rasrtv
//! nssdts
//! ntnada
//! svetve
//! tesnvt
//! vntsnd
//! vrdear
//! dvrsen
//! enarar
//! ```
//!
//! The most common character in the first column is `e`; in the second, `a`; in the third, `s`, and
//! so on. Combining these characters returns the error-corrected message, `easter`.
//!
//! Given the recording in your puzzle input, **what is the error-corrected version** of the message
//! being sent?
//!
//! [repetition code]: https://en.wikipedia.org/wiki/Repetition_code

use anyhow::Result;

pub const INPUT: &str = include_str!("d06.txt");

pub fn solve_part_one(input: &str) -> Result<i64> {
    Ok(0)
}

pub fn solve_part_two(input: &str) -> Result<i64> {
    Ok(0)
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn part_one() {}

    #[test]
    fn part_two() {}
}