feat: solve advent of code 2015 day 1 part a

Author: JCPedroza

src/advent-of-code/2015/01-not-quite-lisp/input-big.txt

@@ -0,0 +1 @@
+(((())))()((((((((())()(()))(()((((()(()(((()((()((()(()()()()()))(((()(()((((((((((())(()()((())()(((())))()(()(()((()(()))(()()()()((()((()(((()()(((((((()()())()((((()()(((((()(())()(())((())()()))()(((((((())(()())(()(((())(()))((())))(()((()())))()())((((())))(()(((((()(())(((()()((()((()((((((((((())(()())))))()))())()()((((()()()()()()((((((())())(((()())()((()()(((()()()))(((((()))(((()(()()()(()(()(((())()))(()(((()((())()(()())())))((()()()(()()(((()))(((()((((()(((((()()(()())((()())())(()((((((()(()()))((((()))))())((())()()((()(()))))((((((((()))(()()(((())())(())()((()()()()((()((()((()()(((())))(()((())()((((((((()((()(()()(((())())())))(())())))()((((()))))))())))()()))()())((()())()((()()()))(()()(((()(())((((())())((((((((()()()()())))()()()((((()()))))))()((((()(((()))(()()())))((()()(((()))()()())())(((())((()()(())()()()(((())))))()())((()))()))((())()()())()())()()(()))())))())()))(())((()(())))(()(())(()))))(()(())())(()(())(()(()))))((()())()))()((((()()))))())))()()())((())()((()()()))()(((()(()))))(())()()))(((()())))))))))(((())))()))())()))))()()(((())))))))()(()()(()))((()))))((())))((()((())))())))()()(()))())()(()((()())(()(()()())())(()()))()))))(()())()()))()()()()))(()(()(()))))))()(()))()))()()(()((())(()(())))()(((())(())())))))()(()(()))))()))(()()()(())()(()(())))()))))()()(((((())))))())()())())())()())()))))()))))))))())()()()()()()())))()))((())()))())))()((())()))))()))())))))))())()()()))()()(()((((()(((((((()(())((()())((()()))()))))(())))()()()(())((())()())))(())))(())))(((()()))()(())(((()(()))((())))())()))((((()))())()))))))))()(())())))(()))()(()()))())()()(())())))())()()(()())))()((()())(()(())(())))))))))))))(()))))()))))))()()())(()(((((()(()())))())()))(()))()))(()()))()())(()))())()(())((()()))))))())))())()(((())))(()(()))()()))()(()))))))((()())(()))))))()())))()()))))))))((((((((()()()(()))))))()())))())))()()((())()))((())(())))())())))()()()((()((()(())))())()(())))))))))()())))()()()()()()))()))((())())(()(()))))))(()()))()))(())))()))))))))))))(()))))))))()))))()))()())()))()()))))))()))))((()))))(()))())()(())))(()())((((()())))()))))(()))()(()()(())))))())))))()))))))())))())))))())))())())))())(()))))(())()(())))())()))((()()))))))())))((())))))))())))(())))))()()())))))())))))()))))))()))()()()(()(((()())())())(()))())))))((()(())(()))))))))(())))()()()())())(()))))()()()))()))())())())()(())))()(((()((((())))))))()))))))))))))))))))))((())()())(()))))()()))))))(()()(())())))())))((())))((())))))))))))))()))))()(()))))))())))))()))(()()())(()())))))))))()))))))(())))))()()))()())(((())))()))(()))))))))(())())))())))())())())()()))((())()(())()())()))()())(())(()))))()())))(()(((()))))))()(()())()()()))()))))))))()()()(())()())()(((((()))()())())(()))))()()()(())))())))()((()())))(()))())()(()())())(()))()()))((()()))((()()()()())))(())()))(()(())))((()()))))))))())))))))())()()))))))))))))))))(())()(())(())()())())()))()(()))))())())))))()())()(()))()()(())))(())())))))(()))))))))))))))())())(())(())))(((()))()))))())((())(()))())))))))())))))())))()))()))))))))))))())()))))()))))((()))(())))()(())))(())()))()))())))())))))))()(()())())))()()())))(())))))(()))))))))))))(()))()))()))())))(((()()()(())((()())))()())(((()))(())()))((()()()())))())(())(()))))()(((((())))(()))())())))))))((((()()()))())())()(()(()())))))))))()())())))(())))()())(((()(())())()()))())())))))))((()())((()()(()))(()(())))()))()))(()))(()))()()(()(((())((((()))()(()))((())()(()(()())()(()))()())))))(()))()))())()())))())))(())))((())(()())))))()))(())(()))()())()(()()((()(()))))))()(())(()())(())()))(((())()))(()()(()()()))))(()(())))()))))())))))())(()()()()()()(((())))(()()))()((())(((((()()())))(()))(()))()()))(((())())()(((()()()()))))(()))(())())))()())(()()())())))))))()))))((())))()())(()))(()(()))())))))())(())))))()()())())()))()()(())))(()))(())((((((())(()))(()))())()))(()()(())))()))(()()))()))()(())))(())))((()(()))(())()()())())))(((()()())(())()))))))()(((()(((((()()(((())(())))())()((()))))((()())()(())(((())))(((()((()(()(()))(()()))())(()))(())(())))()))))))((((()))()((((()(()))()))()()))))()(()(()))()(()((()(((()(()()(((()))))()(((()(()(()(((()(()())())()()(()(()())())(()((((())(()))()))(((((()()())(())()((()()())))()()(((()()))()((((((((()(())))())((()))))(())))(()))))((()((((()()(())(((((()))(((((((((((((()())))((((()(((()((())())()))((()))()(()()((()()()()(()()(()(()(((())()(()((((((()((()()((())()((((()((()()(()()())((()()()((()((())()(()(((()((())((((())(()))((()(()))(()())()((((((((()(((((((((((()))(()(((()(()()()((((())((())()())()))(())((())(()))(((()((()(())))(()))))((()()))))((((()(()(()())(()(())((((((((()((((()((()(((((()))())()(()))(()()((()(())(((((()(())()(((((()()))))))()(((())()(()()((((())()((())((()(((())(((()))((()()((((()(())))))((()((((()((()((()(((())((()))(((((((()(((()((((((((())()))((((())(((((()((((((((()(((()((()(((()()(((()((((((()()(()((((((((()()(()(()(())((((()())()))))(((()))((((())((((()())((()(())()((()((((((()((((((()(())))()())(((())())())()(())()(()())((()()((((())((((((())(()(((((()((((())()((((()(()(())(()())(((())()((())((((()))()((((((())(()(((()(((()((((((()(((()))(()()())())((()((()())()((((())(((()(()(((((((((())(())))()((()()()()(())((()))(((((((()(((((((((()(()))))(()((((((((()((((()((()()((((((()()(((((((()(()(())()(())((()()()((()(((((()())()(((((()())()()((()(()())(()()()(((()()(((((()((((((()()((()(()()()((((((((((((()((((((((()()(((()())))()(((()()(())())((((()((((()((((()()()(())(())((()(()(((((((((((((((()(())(())))))()()))((()(((()(())((()(((()(()()((((()()(((()(((()(((((()()((()(()(((()))((((((()((((((((()((()((())(((((()(((())(())())((()()))((((())()()((()(((()(((((()()(((()))(((()(()(((((((((((((()))((((((((()(((()))))())((((((((((((())((())((()())(((())((())(()((((((((((()(((())((()()(()((())(((((((((((()))((((((((((((()(()())((()((()((()(()(((()((((((((()()(()((()(()(((()))((()))(((((((((((((()(())((((((())(((()(())(()(()(()((()()))((((()((((()((((())))())((((()((((()))((((((()((((((()((()(((())))((())(()))(()((()((((()((()(((()()))((((()()()(((((((())(((())(()))())((((()())(((()(((((((((((()(()(()((()(((((((((((((((()()((((()((((((((()(((()()((()((((()))(((()(())((((((()((((())()((((()((()))(())()(()(((()((())())((((((()(()(())())(((())(()(()())(((((()((()((())()())(())))(((()(())))))))(((()(((()))()((()(((()()((()())()()))())))(((()))(()(((()(((((((((()(()(((((()()(((()())()()))))()(((()))(((()(()(()(()(()))()(())()))(()(((())))(()))))))))))(())((()((())((()(())()(())((()()((((()()((()()))((())(((()((()(())(())))()(()(((((()((()))())()(((((()()(((()(()((((((())(()))(())()))((()(()()))(())())()))(((())))(()((()(((())(())())))((()()((((((((((((((()((()(()()(()(((()))())()()((()()()(())(()))(()())(((())((())()(())()()(()()(())))((()(((()))))(((()()(()()))())((()((())()))((((()()()())((())))(((()(())(((((()(((((()((()(()((((()()(((()()()(((()())(((()()((((())(()))(((()))(())())((()))(((()((()))(((()()((())((()(((((()((((()()())((()))()((((()((()(()()()(

src/advent-of-code/2015/01-not-quite-lisp/part-a/nqla-for-loop.js

@@ -0,0 +1,24 @@
+/**
+ * Finds the floor where santa needs to deliver presents. Uses a for loop.
+ *
+ * Time complexity: O(n)
+ * Space complecity: O(1)
+ *
+ * @param {string} dir Floor directions.
+ * @returns {number} Floor number.
+ */
+const findFloor = (dir) => {
+  let floor = 0
+
+  for (const char of dir) {
+    if (char === '(') floor++
+    else floor--
+  }
+
+  return floor
+}
+
+module.exports = {
+  fun: findFloor,
+  id: 'for-loop'
+}

src/advent-of-code/2015/01-not-quite-lisp/part-a/nqla-recursive-tail.js

@@ -0,0 +1,28 @@
+/**
+ * Finds the floor where santa needs to deliver presents. Uses tail recursion.
+ *
+ * Time complexity: O(n)
+ * Space complexity: O(n)
+ *
+ * @param {string} dir Floor directions.
+ * @returns {number} Floor number.
+ */
+const findFloor = (dir) => {
+  /**
+   * Recursive helper function.
+   * @param {number} idx Current index.
+   * @param {number} sum Current sum.
+   */
+  const recur = (idx, sum) => {
+    if (idx >= dir.length) return sum
+    if (dir[idx] === '(') return recur(idx + 1, sum + 1)
+    else return recur(idx + 1, sum - 1)
+  }
+
+  return recur(0, 0)
+}
+
+module.exports = {
+  fun: findFloor,
+  id: 'tail-recursion'
+}

src/advent-of-code/2015/01-not-quite-lisp/part-a/nqla-recursive.js

@@ -0,0 +1,19 @@
+/**
+ * Finds the floor where santa needs to deliver presents. Uses recursion.
+ *
+ * Time complexity: O(n)
+ * Space complexity: O(n)
+ *
+ * @param {string} dir Floor directions.
+ * @returns {number} Floor number.
+ */
+const findFloor = (dir) => {
+  if (dir.length === 0) return 0
+  if (dir[0] === '(') return 1 + findFloor(dir.slice(1))
+  else return -1 + findFloor(dir.slice(1))
+}
+
+module.exports = {
+  fun: findFloor,
+  id: 'recursion'
+}

src/advent-of-code/2015/01-not-quite-lisp/part-a/nqla-reduce.js

@@ -0,0 +1,19 @@
+/**
+ * Finds the floor where santa needs to deliver presents. Uses the spread
+ * operator, and the map, reduce methods.
+ *
+ * Time complexity: O(n)
+ * Space complexity: O(n)
+ *
+ * @param {string} dir Floor directions.
+ * @returns {number} Floor number.
+ */
+const findFloor = (dir) =>
+  [...dir]
+    .map((char) => char === '(' ? 1 : -1)
+    .reduce((sum, num) => num + sum, 0)
+
+module.exports = {
+  fun: findFloor,
+  id: 'spread-map-reduce'
+}

src/advent-of-code/2015/01-not-quite-lisp/part-a/nqla.repo.js

@@ -0,0 +1,13 @@
+const nqlaForLoop = require('./nqla-for-loop')
+const nqlaReduce = require('./nqla-reduce')
+const nqlaRecursive = require('./nqla-recursive')
+const nqlaTail = require('./nqla-recursive-tail')
+
+const solutions = [
+  nqlaForLoop,
+  nqlaReduce,
+  nqlaRecursive,
+  nqlaTail
+]
+
+module.exports = solutions

src/advent-of-code/2015/01-not-quite-lisp/part-a/nqla.test.js

@@ -0,0 +1,34 @@
+const { describe, it } = require('node:test')
+const assert = require('node:assert/strict')
+
+const { readFileSync } = require('fs')
+const { join } = require('path')
+
+const solutions = require('./nqla.repo')
+
+const bigInputPath = join(__dirname, '../input-big.txt')
+const bigInput = readFileSync(bigInputPath, 'utf-8')
+
+for (const { fun, id } of solutions) {
+  describe(`Advent of Code 'Not Quite Lisp (part a)' solution '${id}'`, () => {
+    it('Solves empty string', () => {
+      assert.equal(fun(''), 0)
+    })
+
+    it('Solves string of length 1', () => {
+      assert.equal(fun('('), 1)
+      assert.equal(fun(')'), -1)
+    })
+
+    it('Solves string of length 4', () => {
+      assert.equal(fun('(())'), 0)
+      assert.equal(fun('()()'), 0)
+      assert.equal(fun('((()'), 2)
+      assert.equal(fun('))))'), -4)
+    })
+
+    it('Solves big input', () => {
+      assert.equal(fun(bigInput), 232)
+    })
+  })
+}

src/advent-of-code/2015/01-not-quite-lisp/part-a/nqla.time.js

@@ -0,0 +1,14 @@
+const { readFileSync } = require('fs')
+const { join } = require('path')
+
+const { timeAndReport } = require('../../../../../lib/time')
+const solutions = require('./nqla.repo')
+
+const bigInputPath = join(__dirname, '../input-big.txt')
+const bigInput = readFileSync(bigInputPath, 'utf-8')
+
+const args = [bigInput]
+const runs = 1_000
+const id = 'Advent of Code "Not Quite Lisp (part a)"'
+
+timeAndReport(solutions, args, runs, id)