Added day 9 solved in ruby

[Duxy1996]

Duxy's solution for day 9 challenge

Description

Given a string, get the score of the groups generated(avoiding the garbage sequences )
Get the number of chars of the garbage sequences

Solution

I iterate the string, and I have 3 flags (for the groups, for the rubbish and for the jump characters ) every time I see a the indicates character i add one or substract one to the flags. Depending of the number of each flag the program do some operations; ej: if the flag of garbage is > 0 I cant modify the groups's tag.

Tests battery

I have donde test for each example given in the AOC day 9, and then other extra mixing it all together.

{}, score of 1.
{{{}}}, score of 1 + 2 + 3 = 6.
{{},{}}, score of 1 + 2 + 2 = 5.
{{{},{},{{}}}}, score of 1 + 2 + 3 + 3 + 3 + 4 = 16.
{<a>,<a>,<a>,<a>}, score of 1.
{{<ab>},{<ab>},{<ab>},{<ab>}}, score of 1 + 2 + 2 + 2 + 2 = 9.
{{<!!>},{<!!>},{<!!>},{<!!>}}, score of 1 + 2 + 2 + 2 + 2 = 9.
{{<a!>},{<a!>},{<a!>},{<ab>}}, score of 1 + 2 = 3.

I use the engine of ruby. This tests were very useful, I recommend to see them.

Happy Advent of Code!

[Cotel]

The algorithm is quite similar to mine 💯

[Cotel]

Wow, big file here. I would recommend you to separate and reuse code. Follow the DRY principle 😉

[Cotel]

I can see you are using novalid as a boolean. Using int flags can be quite tough to read.

[Cotel]

Same here.

[Cotel]

Better spacing in this file 👍