Advent of Code 2022

Artifact b7b3ef059356cc314be691cdbb6b711fb52fee0d0907403de39cdecc86b45c03:

• File day3/scripts.ts — part of check-in [624fe985d2] at 2022-12-03 20:38:24 on branch trunk — Add initial solution for day 3 (user: marv size: 1189)

import { sum } from "util/array";

// If blank strings/ints is not enough
export const inputMapper = (inputs: string) => inputs;

// index of char is their priority
const priority = " abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";

export function solution1(inputs: string[]): number {
  const items = inputs.map((inputs) => [
    inputs.slice(0, inputs.length / 2),
    inputs.slice(inputs.length / 2),
  ]).map(([bag1, bag2]) =>
    // Find duplicate
    bag1.split("").filter((c) => bag2.includes(c))[0]
  ).map((item) => priority.indexOf(item));

  return sum(items);
}

export function partitionArray<T>(arr: T[], partitionSize: number): T[][] {
  return arr.reduce((all: T[][], one: T, i: number) => {
    const chunk = Math.floor(i / partitionSize);

    all[chunk] = ([] as T[]).concat(
      all[chunk] ?? [],
      one,
    );

    return all;
  }, []);
}

export function solution2(inputs: string[]): number {
  const groups = partitionArray(inputs, 3);

  const items = groups.map(([bag1, bag2, bag3]) =>
    bag1.split("").filter((c) => bag2.includes(c)).filter((c) =>
      bag3.includes(c)
    )[0]
  ).map((item) => priority.indexOf(item));

  return sum(items);
}