인프런 커뮤니티 질문&답변

let queue = Array.from({ length: n }, (_, i) => i + 1);
  let pos = 0;
  let cnt = 0;

  while (queue.length > 1) {
    if (++cnt === k) {
      queue.splice(pos, 1);
      cnt = 0;
      pos--;
    }
    pos = (pos + 1) % queue.length;
  }
  answer = queue[0];

  return answer;