Wheat and chessboard problem

Wheat and chessboard problemWikipedia

The wheat/rice and chessboard problemCodewars

Javascript solution

recursive solution

const squaresNeeded = (grains, unit = 1, step = 0) => {
  return grains < 1 ? step : squaresNeeded(grains - unit, unit * 2, step + 1);
};

bit length solution

// bit length solution
// inspired from python best practice
const squaresNeededBit = (grains) => (grains ? grains.toString(2).length : 0);

Best practice in codewars

written by [gideo, Voile, ASDFGerte, ajaczgz, Theplay4play, swalchemist] (plus 46 more warriors)

function squaresNeeded(grains){
  return Math.ceil(Math.log2(grains+1))
}

Python solution

Recursive solution

def squares_needed(grains, unit=1, step=0):
    return step if grains < 1 else squares_needed(grains - unit, unit * 2, step + 1)

Best practice in codewars

written by [Unnamed, suic, monochromeninja, CopperWye, MercenaryChaos]

squares_needed = int.bit_length