cortezcristian

cortezcristian

cortezcristian

let nearestLowerPow2 = function (x) {
  if (x == 0) return 0;
  const arr = [1, 2, 4, 8, 16];
  arr.forEach(function(n) {
    x |= (x >> n);
  });

  return x - (x >> 1);
}

cortezcristian

// 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);
};

cortezcristian

// My ugly first solution draft
const solution = (n) => {
  // Ensure n is number
  if (typeof n !== 'number') return 0;
  // Ensure n is > 0
  if (n < 1) return 0;

  // This array represents the circle
  const arr = [];
  // Fill the array with 1 ones to begin