Yesterday’s solution already looks facepalm worthy even though its been only 24 hours since. Hopefully today’s parsing code will be better. Let’s do this.
Day 2 - Part 1 Sample input for the first part is :
Game 1: 3 blue, 4 red; 1 red, 2 green, 6 blue; 2 green Game 2: 1 blue, 2 green; 3 green, 4 blue, 1 red; 1 green, 1 blue Game 3: 8 green, 6 blue, 20 red; 5 blue, 4 red, 13 green; 5 green, 1 red Game 4: 1 green, 3 red, 6 blue; 3 green, 6 red; 3 green, 15 blue, 14 red Game 5: 6 red, 1 blue, 3 green; 2 blue, 1 red, 2 green The games are numbered and each game has multiple sets separated by ; with colored cubes taken from a bag. The condition is that maximum 12 red, 13 green and 14 blue cubes are allowed. So if any set in a game exceeds this limit, the game becomes invalid. We have to calculate the sum of id’s of valid games. With the sample input, games 3 (20 red) and 4 (15 blue) are rejected and sum of id’s of the remaining games is 8.
...