알고리즘 모의고사 자바스크립트

function solution(answers) {
   let answer = [];
    let list = [
        [1,2,3,4,5],
        [2, 1, 2, 3, 2, 4, 2, 5],
        [3, 3, 1, 1, 2, 2, 4, 4, 5, 5],
    ]
    
    let point = [0,0,0];
    
    for(let i =0; i< answers.length; i++) {
        if(answers[i] === list[0][i%list[0].length]) point[0]++
        if(answers[i] === list[1][i%list[1].length]) point[1]++
        if(answers[i] === list[2][i%list[2].length]) point[2]++
    }
    
    let max = Math.max(...point);
    
    for (let i = 0; i <point.length; i++) {
        if(point[i] === max) answer.push(i+1)
    }
    
    return answer;
}