Print all solutions.

So that I can perceive the effects of my code's performance

main.go

@@ -1,7 +1,11 @@
 package main
 
-import "advent-20/solutions"
+import (
+	"advent-20/solutions"
+	"fmt"
+)
 
 func main() {
-	solutions.Day01Part01()
+	fmt.Println("Day 01 part 1:\t", solutions.Day01Part01(false))
+	fmt.Println("Day 01 part 2:\t", solutions.Day01Part02(false))
 }

solutions/day01.go

@@ -1,13 +1,12 @@
 package solutions
 
 import (
-	"fmt"
 	"strconv"
 	"strings"
 )
 
-func Day01Part01() {
-	input := ReadInput("01", true)
+func Day01Part01(isTest bool) int {
+	input := ReadInput("01", isTest)
 	values := strings.Split(input, "\n")
 	remainders := make(map[int]bool)
 
@@ -20,10 +19,37 @@ func Day01Part01() {
 		currentRemainder := 2020 - value
 
 		if _, err := remainders[currentRemainder]; err {
-			fmt.Println(value * currentRemainder)
-			break
+			return value * currentRemainder
 		} else {
 			remainders[value] = true
 		}
 	}
+
+	return -1
+}
+
+func Day01Part02(isTest bool) int {
+	input := ReadInput("01", isTest)
+	strValues := strings.Split(input, "\n")
+	values := make([]int, len(strValues))
+	for i, valueStr := range strValues {
+		value, err := strconv.Atoi(valueStr)
+		if err != nil {
+			panic("Error converting to int")
+		}
+		values[i] = value
+	}
+
+	arrLen := len(values)
+	for i := 0; i < arrLen; i += 1 {
+		for j := i + 1; j < arrLen; j += 1 {
+			for k := j + 1; k < arrLen; k += 1 {
+				if values[i]+values[j]+values[k] == 2020 {
+					return (values[i] * values[j] * values[k])
+				}
+			}
+		}
+	}
+
+	return -1
 }