coddejam2020qualifications1.js

const containsDuplicate = (array) => {
  const set = new Set();
  for (const item of array) {
    if (set.has(item)) {
      return true;
    }
    set.add(item);
  }
  return false;
};

const invertMatrix = (matrix) => {
  const colCount = matrix[0].length;
  const invertedMatrix = [];
  for (let rowIndex = 0; rowIndex < matrix.length; rowIndex++) {
    const row = [];
    for (let colIndex = 0; colIndex < colCount; colIndex++) {
      row.push(matrix[colIndex][rowIndex]);
    }
    invertedMatrix.push(row);
  }
  return invertedMatrix;
}


const runTest = ({ headerLine, size, lines }) => {
  const matrix = lines.map(line => line.split(' ').map(str => +str));
  const trace = matrix.reduce((sum, row, rowIndex) => sum + row[rowIndex], 0);
  const countRepeatingRows = m => m.reduce(
    (sum, row, rowIndex) =>
      sum + (containsDuplicate(row) ? 1 : 0),
    0
  );
  const repeatingRows = countRepeatingRows(matrix);
  const invertedMatrix = invertMatrix(matrix);
  const repeatingColumns = countRepeatingRows(invertedMatrix);
  return `${trace} ${repeatingRows} ${repeatingColumns}`;

coddejam2020qualifications2.js

const runTest = ({ lines }) => {
  const list = lines[0].split('').map(str => +str);
  // console.log('list', list)
  let depth = 0;
  let out = '';
  const goUp = (step) => {
    if (step <= 0) { return }
    depth -= step;
    for (let i = 0; i < step; i++) {
      out += ')';
    }
  };
  const goDown = (step) => {
    if (step <= 0) { return }
    depth += step;
    for (let i = 0; i < step; i++) {
      out += '(';
    }
  };
  for (let i = 0; i < list.length; i++) {
    const nextNumber = list[i];
    goDown(nextNumber - depth);
    goUp(depth - nextNumber);
    out += String(nextNumber);
  }
  goUp(depth);
  return out;
};

coddejam2020qualifications3.js

const runTest = ({ headerLine, size, lines }) => {
  const tasks = lines.map((line, lineIndex) => {
    const [ start, end ] = line.split(' ').map(str => +str);
    return { start, end, taskIndex: lineIndex };
  });
  // console.log('tasks', tasks)
  const workers = [
    { name: 'C', availableTime: 0 },
    { name: 'J', availableTime: 0 }
  ];
  let schedule = [];

  tasks
    .sort((t1, t2) => t1.start - t2.start)
    .forEach(({ start, end, taskIndex }) => {
      // console.log('Task', start, end)
      for (const worker of workers) {
        if (worker.availableTime <= start) {
          worker.availableTime = end;
          schedule[taskIndex] = worker.name;
          return;
        }
      }
      throw new ImpossibleError();
    });
  return schedule.join('');
};