## 2020 Advent of Code–Day 2

This series looks at the Advent of Code challenges.

As one of my goals, I’m working through challenges. This post looks at day 2.

## Part 1

This problem is really a string processing issue. We get a long string that needs splitting into different parts. We have two numbers, a digit to check, and a password. In this part, we are looking to see if our check digit appears x number of times.

For T-SQL, we can use Substring and charindex to split things. I had code like this:

`SELECT             SUBSTRING(datavalue, 1, CHARINDEX('-', datavalue) - 1) AS lowerbound           , SUBSTRING(datavalue, CHARINDEX('-', datavalue) + 1, CHARINDEX(' ', datavalue) - CHARINDEX('-', datavalue) - 1) AS upperbound           , SUBSTRING(datavalue, CHARINDEX(' ', datavalue) + 1, 1)           , SUBSTRING(datavalue, CHARINDEX(':', datavalue) + 2, 50)        FROM dbo.Day2 AS d`

From here, I can do some counting to determine if we have the correct number of check digits.

For Python and PowerShell, I used split functions. The PowerShell one I did in two routines, one to break the numbers off into \$counters, after everything is split.

`\$values = \$line.Split(' ')\$counters = \$values.split('-')`

From here, I could then break everything up into the 4 parts.

`\$min = \$counters\$max = \$counters\$checkvalue = \$values.Substring(0, \$values.Length - 1)\$pwd = \$values`

Now I get a count, and then an IF statement that can clean this up.

`if ((\$count -ge \$min) -and (\$count -le \$max)) { \$part1 += 1}if ((\$checkvalue -eq \$pwd[\$min-1]) -ne (\$checkvalue -eq \$pwd[\$max-1])) { \$part2 += 1}`

This worked right away.

## Part 2

In Part 2, rather than counting, we are deciding if the check digit is in the positions specified by the numbers.  The trick here is to check if that substring is equal to the digit. Again, in PoSh, the trick is to see if we have one or the other, which is the requirement.

`if ((\$checkvalue -eq \$pwd[\$min-1]) -ne (\$checkvalue -eq \$pwd[\$max-1])) { \$part2 += 1}`

This code looks if the digit matches first, then the second digit matches, and if these are both a 0 or 1, it’s not valid. If only one is valid, we increment the counter.

The python code is very similar. 