answer_2 = {
const width = input[0].length;
let encounters = [];
let stepsx = [1, 3, 5, 7];
for (const step of stepsx) {
let trees = 0,
x = 0;
for (let y = 0; y < input.length; y++) {
trees += input[y][x];
x = (x + step) % width;
}
encounters.push(trees);
}
{
let trees = 0,
x = 0;
for (let y = 0; y < input.length; y += 2) {
trees += input[y][x];
x = (x + 1) % width;
}
encounters.push(trees);
}
let mult = 1;
for (const trees of encounters) mult *= trees;
return { mult, encounters };
}