DEV Community

loading...

[Advent of Code 2020] Day 18 Solution (TypeScript)

kais_blog profile image Kai Originally published at kais.blog ・3 min read

This post was originally published at kais.blog. It is part of a series of step-by-step tutorials about the Advent of Code 2020 event.

If you like my content and you want to see more, please follow me on Twitter!

Questions, feedback or just wanna chat? Come and join my Discord!

Prerequisites

I assume you've put your puzzle input into an array called lines where each array item is a line of the input text file. It's up to you to either parse the text file or create an array by hand.

const lines = [
  "3 * (9 + 5 * (8 * 9 * 6)) * 5 * 6",
  "5 + (5 + (6 + 8 * 6 * 9 + 7 + 4) + 2 * 3 * (7 * 5 * 5 * 4 + 2)) * 3 + 5 * 6 * 8",
  "4 + 3 + 4 + (2 * 9 + 3 + 9 + 7) + 9",
  
];
Enter fullscreen mode Exit fullscreen mode

Solution

Preface

Starting with Day 10, I'll just publish my solution for both parts without explaining every single step. Unfortunately, I can't continue providing full step-by-step tutorials for each day. The concepts used get more difficult day by day. So, I've concluded that it's better if I wrote separate blog posts about these concepts later.

Also, it's holiday season. This makes it much more difficult creating well-thought-out tutorials. However, I'll try to annotate my code examples a little. This way, you might understand what I've done.

I will now move on to sharing useful tips for web developers regularly. These should help you become a better developer. Also, the shared tips should help with solving problems like those we encounter in Advent of Code. Here's my first post: 14 Awesome JavaScript Array Tips You Should Know About

Puzzle

Just to make sure, you know what I'm talking about, take a look at today's puzzle:

Day 18: Operation Order

Part 1

  const postfixNotations = lines.map(parse);
  const solutions = postfixNotations.map(solve);

  return solutions.reduce((previous, current) => previous + current);
Enter fullscreen mode Exit fullscreen mode
function parse(expression: string) {
  const tokens = [...expression.replaceAll(" ", "")];

  const operatorStack: string[] = [];
  const outputQueue: string[] = [];

  tokens.forEach((token) => {
    if (["+", "*"].includes(token)) {
      while (
        operatorStack.length > 0 &&
        ["+", "*"].includes(operatorStack.slice().pop()!)
      ) {
        const operator = operatorStack.pop()!;
        outputQueue.push(operator);
      }

      operatorStack.push(token);
      return;
    }

    if (token === "(") {
      operatorStack.push(token);
      return;
    }

    if (token === ")") {
      while (operatorStack.length > 0 && operatorStack.slice().pop() !== "(") {
        const operator = operatorStack.pop()!;
        outputQueue.push(operator);
      }

      operatorStack.pop();
      return;
    }

    outputQueue.push(token);
  });

  while (operatorStack.length > 0) {
    const operator = operatorStack.pop()!;
    outputQueue.push(operator);
  }

  return outputQueue;
}
Enter fullscreen mode Exit fullscreen mode
function solve(postfixNotation: string[]) {
  const stack: number[] = [];

  postfixNotation.forEach((value) => {
    const number = Number(value);

    if (!Number.isNaN(number)) {
      stack.push(number);
      return;
    }

    const a = stack.pop();
    const b = stack.pop();

    switch (value) {
      case "+":
        stack.push(Number(a) + Number(b));
        break;
      case "*":
        stack.push(Number(a) * Number(b));
        break;
    }
  });

  return stack.pop()!;
}
Enter fullscreen mode Exit fullscreen mode

Part 2

const postfixNotations = lines.map(parse);
const solutions = postfixNotations.map(solve);

return solutions.reduce((previous, current) => previous + current);
Enter fullscreen mode Exit fullscreen mode
const precedenceLevels: Record<string, number> = {
  "+": 3,
  "*": 2,
};
Enter fullscreen mode Exit fullscreen mode
function parse(expression: string) {
  const tokens = [...expression.replaceAll(" ", "")];

  const operatorStack: string[] = [];
  const outputQueue: string[] = [];

  tokens.forEach((token) => {
    if (["+", "*"].includes(token)) {
      while (
        operatorStack.length > 0 &&
        ["+", "*"].includes(operatorStack.slice().pop()!)
      ) {
        if (
          precedenceLevels[token] >
          precedenceLevels[operatorStack.slice().pop()!]
        ) {
          break;
        }

        const operator = operatorStack.pop()!;
        outputQueue.push(operator);
      }

      operatorStack.push(token);
      return;
    }

    if (token === "(") {
      operatorStack.push(token);
      return;
    }

    if (token === ")") {
      while (operatorStack.length > 0 && operatorStack.slice().pop() !== "(") {
        const operator = operatorStack.pop()!;
        outputQueue.push(operator);
      }

      operatorStack.pop();
      return;
    }

    outputQueue.push(token);
  });

  while (operatorStack.length > 0) {
    const operator = operatorStack.pop()!;
    outputQueue.push(operator);
  }

  return outputQueue;
}
Enter fullscreen mode Exit fullscreen mode
function solve(postfixNotation: string[]) {
  const stack: number[] = [];

  postfixNotation.forEach((value) => {
    const number = Number(value);

    if (!Number.isNaN(number)) {
      stack.push(number);
      return;
    }

    const a = stack.pop();
    const b = stack.pop();

    switch (value) {
      case "+":
        stack.push(Number(a) + Number(b));
        break;
      case "*":
        stack.push(Number(a) * Number(b));
        break;
    }
  });

  return stack.pop()!;
}
Enter fullscreen mode Exit fullscreen mode

If you like my content and you want to see more, please follow me on Twitter!

Questions, feedback or just wanna chat? Come and join my Discord!

This post was originally published at kais.blog.

Discussion (0)

pic
Editor guide