Coding the Josephus Problem solution3.js

solution3.js

// Third solution binary based
const solution3 = (n) => {
  // Convert to BIN
  const binaryStr = Number(n).toString(2);
  // Swapping digits
  const newBinaryStr = (binaryStr + binaryStr[0]).replace(/./, '');
  // Convert back to DEC
  return parseInt(newBinaryStr, 2);
};

const position = solution3(5);
console.log(position); // >>> 3