const mostFrequent = numbers.reduce((acc, num) => {
  acc[num] = (acc[num] || 0) + 1;
  return Object.keys(acc).reduce((a, b) => (acc[a] > acc[b] ? a : b));
}, {});

const mostFrequent = numbers.reduce((acc, num) => {
  acc[num] = (acc[num] || 0) + 1;
  return acc;
}, {});
const result = Object.entries(mostFrequent).reduce((a, b) =>
  a[1] > b[1] ? a : b
)[0];

const mostFrequent = numbers.reduce((acc, num) => {
  acc[num] = (acc[num] || 0) + 1;
  return acc[num] > acc[acc.max] ? { ...acc, max: num } : acc;
}, { max: null }).max;

const mostFrequent = numbers.reduce((acc, num) => {
  acc[num] = (acc[num] || 0) + 1;
  return acc[num] > acc.highest ? num : acc.highest;
}, { highest: null });