most-ocuring

const arrThree = [1, 2, 1, 4, 2, 4, 2, 3, 3, 5, 6, 7, 3, 2];

arrThree.sort((a, b) => a - b);
console.log(arrThree);

let length = 0;
let biggestLength = 0;
let mostFreq;

for (let i = 1; i <= arrThree.length; i++) {

    if (arrThree[i - 1] === arrThree[i]) {
        length++
    } else {

        if (length > biggestLength) {
            biggestLength = length
            length = 0;
            mostFreq = arrThree[i - 1]
        } else {
            length = 0;
        }
    }
}
console.log(`${mostFreq} (${biggestLength + 1} times)`)