Added answers to descriptions

Refactored utils.js

Author: hankolsen

day1/description.txt

@@ -21,6 +21,9 @@ For example:
 What is the solution to your captcha?
 
 
+Your puzzle answer was 1223.
+
+
 --- Part Two ---
 
 You notice a progress bar that jumps to 50% completion. Apparently, the door isn't yet satisfied, but it did emit a star as encouragement. The instructions change:
@@ -34,4 +37,7 @@ For example:
 123425 produces 4, because both 2s match each other, but no other digit has a match.
 123123 produces 12.
 12131415 produces 4.
-What is the solution to your new captcha?
+What is the solution to your new captcha?
+
+
+Your puzzle answer was 1284.

day1/index.js

@@ -1,12 +1,10 @@
 #!/usr/bin/env node
-const { getInput } = require('../utils');
+const { getRow } = require('../utils');
 const { sum } = require('./sum');
 
-getInput()
+getRow()
   .then((data) => {
-    const input = data[0];
-
-    console.log(`Part 1: ${sum(input)}`);
-    console.log(`Part 2: ${sum(input, true)}`);
+    console.log(`Part 1: ${sum(data)}`);
+    console.log(`Part 2: ${sum(data, true)}`);
   })
   .catch(err => console.log(`There was an error\n${err}`));

day10/description.txt

@@ -35,6 +35,10 @@ In this example, the first two numbers in the list end up being 3 and 4; to chec
 
 However, you should instead use the standard list size of 256 (with values 0 to 255) and the sequence of lengths in your puzzle input. Once this process is complete, what is the result of multiplying the first two numbers in the list?
 
+
+Your puzzle answer was 54675.
+
+
 --- Part Two ---
 
 The logic you've constructed forms a single round of the Knot Hash algorithm; running the full thing requires many of these rounds. Some input and output processing is also required.
@@ -60,4 +64,7 @@ The empty string becomes a2582a3a0e66e6e86e3812dcb672a272.
 AoC 2017 becomes 33efeb34ea91902bb2f59c9920caa6cd.
 1,2,3 becomes 3efbe78a8d82f29979031a4aa0b16a9d.
 1,2,4 becomes 63960835bcdc130f0b66d7ff4f6a5a8e.
-Treating your puzzle input as a string of ASCII characters, what is the Knot Hash of your puzzle input? Ignore any leading or trailing whitespace you might encounter.
+Treating your puzzle input as a string of ASCII characters, what is the Knot Hash of your puzzle input? Ignore any leading or trailing whitespace you might encounter.
+
+
+Your puzzle answer was a7af2706aa9a09cf5d848c1e6605dd2a.

day10/index.js

@@ -1,16 +1,16 @@
 #!/usr/bin/env node
-const { applyLengths, getInput, hashString } = require('../utils');
+const { applyLengths, getRow, hashString } = require('../utils');
 
 
 const listSize = 256;
 
 
-getInput()
+getRow()
   .then((data) => {
 
     const part1 = () => {
       const list = [...Array(listSize).keys()];
-      const lengths = data[0]
+      const lengths = data
         .split(',')
         .map(char => parseInt(char, 10));
 
@@ -19,7 +19,7 @@ getInput()
     };
 
     const part2 = () => {
-      console.log(hashString(data[0]));
+      console.log(hashString(data));
     };
 
     part1();

day11/description.txt

@@ -24,7 +24,14 @@ ne,ne,sw,sw is 0 steps away (back where you started).
 ne,ne,s,s is 2 steps away (se,se).
 se,sw,se,sw,sw is 3 steps away (s,s,sw).
 
+
+Your puzzle answer was 720.
+
+
 --- Part Two ---
 
 How many steps away is the furthest he ever got from his starting position?
 
+
+Your puzzle answer was 1485.
+

day11/index.js

@@ -1,6 +1,6 @@
 #!/usr/bin/env node
 /* eslint no-param-reassign: 0 */
-const { getInput } = require('../utils');
+const { getRow } = require('../utils');
 
 const hexDirections = {
   n: { x: 0, y: 1 },
@@ -18,13 +18,13 @@ const manhattanDistanceHex = ({ x, y }) => {
   return Math.max(Math.abs(x), Math.abs(y));
 };
 
-getInput()
+getRow()
   .then((data) => {
 
     let maxDistance = 0;
     let currentDistance = 0;
 
-    data[0]
+    data
       .split(',')
       .map(step => hexDirections[step])
       .reduce((totalSteps, distance) => {

day12/description.txt

@@ -31,6 +31,10 @@ Therefore, a total of 6 programs are in this group; all but program 1, which has
 
 How many programs are in the group that contains program ID 0?
 
+
+Your puzzle answer was 378.
+
+
 --- Part Two ---
 
 There are more programs than just the ones in the group containing program ID 0. The rest of them have no way of reaching that group, and still might have no way of reaching each other.

day12/index.js

@@ -1,7 +1,7 @@
 #!/usr/bin/env node
-const { getInput } = require('../utils');
+const { getRows } = require('../utils');
 
-getInput()
+getRows()
   .then((data) => {
 
     const programs = data

day13/description.txt

@@ -158,6 +158,10 @@ The severity of getting caught on a layer is equal to its depth multiplied by it
 
 Given the details of the firewall you've recorded, if you leave immediately, what is the severity of your whole trip?
 
+
+Your puzzle answer was 1960.
+
+
 --- Part Two ---
 
 Now, you need to pass through the firewall without being caught - easier said than done.
@@ -271,4 +275,7 @@ Picosecond 16:
                 [ ]     [ ]
 Because all smaller delays would get you caught, the fewest number of picoseconds you would need to delay to get through safely is 10.
 
-What is the fewest number of picoseconds that you need to delay the packet to pass through the firewall without being caught?
+What is the fewest number of picoseconds that you need to delay the packet to pass through the firewall without being caught?
+
+
+Your puzzle answer was 3903378.

day13/index.js

@@ -1,8 +1,8 @@
 #!/usr/bin/env node
 /* eslint no-param-reassign: 0 */
-const { getInput } = require('../utils');
+const { getRows } = require('../utils');
 
-getInput()
+getRows()
   .then((data) => {
     const input = data.map((row) => {
       const [depth, range] = row.split(': ');