The puzzle today was sort of interesting, because my solution is quite unique. Because this puzzle is inspired by real-life bracket pairing problems, people typically implement an algorithm along that line. But I was completely oblivious of those algorithm, so I had another approach! My attempt works fine for this puzzle, but i’s probably useless if I want to expand my solution to a full-fledge parser.

## Part 1

## Show challenge - day 10, part 1

You ask the submarine to determine the best route out of the deep-sea cave, but it only replies:

`Syntax error in navigation subsystem on line: all of them`

**All of them?!**
The damage is worse than you thought.
You bring up a copy of the navigation subsystem (your puzzle input).

The navigation subsystem syntax is made of several lines containing **chunks**.
There are one or more chunks on each line, and chunks contain zero or more other chunks.
Adjacent chunks are not separated by any delimiter; if one chunk stops, the next chunk (if any) can immediately start.
Every chunk must **open** and **close** with one of four legal pairs of matching characters:

- If a chunk opens with
`(`

, it must close with`)`

. - If a chunk opens with
`[`

, it must close with`]`

. - If a chunk opens with
`{`

, it must close with`}`

. - If a chunk opens with
`<`

, it must close with`>`

.

So, () is a legal chunk that contains no other chunks, as is `[]`

. More complex but valid chunks include `([])`

, `{()()()}`

, `<([{}])>`

, `[<>({}){}[([])<>]]`

, and even `(((((((((())))))))))`

.

Some lines are **incomplete**, but others are **corrupted**.
Find and discard the corrupted lines first.

A corrupted line is one where a chunk **closes with the wrong character** - that is, where the characters it opens and closes with do not form one of the four legal pairs listed above.

Examples of corrupted chunks include `(],`

`{()()()>`

, `(((()))}`

, and `<([]){()}[{}])`

.
Such a chunk can appear anywhere within a line, and its presence causes the whole line to be considered corrupted.

For example, consider the following navigation subsystem:

```
[({(<(())[]>[[{[]{<()<>>
[(()[<>])]({[<{<<[]>>(
{([(<{}[<>[]}>{[]{[(<()>
(((({<>}<{<{<>}{[]{[]{}
[[<[([]))<([[{}[[()]]]
[{[{({}]{}}([{[{{{}}([]
{<[[]]>}<{[{[{[]{()[[[]
[<(<(<(<{}))><([]([]()
<{([([[(<>()){}]>(<<{{
<{([{{}}[<[[[<>{}]]]>[]]
```

Some of the lines aren’t corrupted, just incomplete; you can ignore these lines for now. The remaining five lines are corrupted:

`{([(<{}[<>[]}>{[]{[(<()>`

- Expected`]`

, but found`}`

instead.`[[<[([]))<([[{}[[()]]]`

- Expected`]`

, but found`)`

instead.`[{[{({}]{}}([{[{{{}}([]`

- Expected`)`

, but found`]`

instead.`[<(<(<(<{}))><([]([]()`

- Expected`>`

, but found`)`

instead.`<{([([[(<>()){}]>(<<{{`

- Expected`]`

, but found`>`

instead.

Stop at the first incorrect closing character on each corrupted line.

Did you know that syntax checkers actually have contests to see who can get the high score for syntax errors in a file?
It’s true!
To calculate the syntax error score for a line, take the **first illegal character** on the line and look it up in the following table:

`)`

:`3`

points.`]`

:`57`

points.`}`

:`1197`

points.`>`

:`25137`

points.

In the above example, an illegal `)`

was found twice (`2*3 = 6`

points), an illegal `]`

was found once (`57`

points), an illegal `}`

was found once (`1197`

points), and an illegal `>`

was found once (`25137`

points). So, the total syntax error score for this file is `6+57+1197+25137 = 26397`

points!

Find the first illegal character in each corrupted line of the navigation subsystem.
**What is the total syntax error score for those errors?**

The input for today’s puzzle borked with the rendering of this page, so you can find it here. It’s quite long so don’t try to scroll through:

```
using Pipe: @pipe
function remove_all_pairs(line)
for _ in 1:20
line1 = replace(line, "()"=>"", "[]"=>"", "{}"=>"", "<>"=>"")
if isequal(line1, line)
return(line)
else
line = line1
end
end
end
nav = split(remove_all_pairs(strip(input)), "\n") .|> string
trimmed_nav = nav .|>
replace(_, r"(\(|\[|{|<)"=>"") |>
filter(!=(""),_) |>
getindex.(_, 1)
((count.(==(')'), trimmed_nav) .|> sign) .* 3 |> sum) +
((count.(==(']'), trimmed_nav) .|> sign) .* 57 |> sum) +
((count.(==('}'), trimmed_nav) .|> sign) .* 1197 |> sum) +
((count.(==('>'), trimmed_nav) .|> sign) .* 25137|> sum) |> print
```

## Part 2

## Show challenge - day 10, part 2

Now, discard the corrupted lines.
The remaining lines are **incomplete**.

Incomplete lines don’t have any incorrect characters - instead, they’re missing some closing characters at the end of the line.
To repair the navigation subsystem, you just need to figure out **the sequence of closing characters** that complete all open chunks in the line.

You can only use closing characters (`)`

, `]`

, `}`

, or `>`

), and you must add them in the correct order so that only legal pairs are formed and all chunks end up closed.

In the example above, there are five incomplete lines:

`[({(<(())[]>[[{[]{<()<>>`

- Complete by adding`}}]])})]`

.`(()[<>])]({[<{<<[]>>(`

- Complete by adding`)}>]})`

.`(((({<>}<{<{<>}{[]{[]{}`

- Complete by adding`}}>}>))))`

.`{<[[]]>}<{[{[{[]{()[[[]`

- Complete by adding`]]}}]}]}>`

.`<{([{{}}[<[[[<>{}]]]>[]]`

- Complete by adding`])}>`

.

Did you know that autocomplete tools **also** have contests?
It’s true!
The score is determined by considering the completion string character-by-character.
Start with a total score of `0`

.
Then, for each character, multiply the total score by 5 and then increase the total score by the point value given for the character in the following table:

`)`

:`1`

point.`]`

:`2`

points.`}`

:`3`

points.`>`

:`4`

points.

So, the last completion string above - `])}>`

- would be scored as follows:

- Start with a total score of
`0`

. - Multiply the total score by
`5`

to get`0`

, then add the value of`]`

(2) to get a new total score of`2`

. - Multiply the total score by
`5`

to get`10`

, then add the value of`)`

(1) to get a new total score of`11`

. - Multiply the total score by
`5`

to get`55`

, then add the value of`}`

(3) to get a new total score of`58`

. - Multiply the total score by
`5`

to get`290`

, then add the value of`>`

(4) to get a new total score of`294`

.

The five lines’ completion strings have total scores as follows:

`}}]])})]`

-`288957`

total points.`)}>]})`

-`5566`

total points.`}}>}>))))`

-`1480781`

total points.`]]}}]}]}>`

-`995444`

total points.`])}>`

-`294`

total points.

Autocomplete tools are an odd bunch: the winner is found by **sorting** all of the scores and then taking the **middle** score.
(There will always be an odd number of scores to consider.)
In this example, the middle score is `288957`

because there are the same number of scores smaller and larger than it.

Find the completion string for each incomplete line, score the completion strings, and sort the scores.
**What is the middle score?**

Here’s the solution:

```
using Pipe: @pipe
nav = split(strip(input), "\n") .|> string
function remove_all_pairs(line)
for _ in 1:20
line1 = replace(line, "()"=>"", "[]"=>"", "{}"=>"", "<>"=>"")
if isequal(line1, line)
return(line)
else
line = line1
end
end
end
function complete_score(s)
score = 0
for i in length(s)👎1
score = score * 5
if s[i] == '('
score += 1
elseif s[i] == '['
score += 2
elseif s[i] == '{'
score += 3
elseif s[i] == '<'
score += 4
end
end
return score
end
trimmed_nav = remove_all_pairs.(nav)
incomplete_nav = trimmed_nav[replace.(trimmed_nav, r"(\(|\[|{|<)"=>"") .== ""]
incomplete_nav =
@pipe incomplete_nav .|>
replace(_, r"(\)|\]|}|>)"=>"")
@pipe complete_score.(incomplete_nav) |> sort |>
_[Int(ceil(length(_)/2))] |> print
```