Codewars Kata: Your task is to construct a building which will be a pile of n cubes. The cube at the bottom will have a volume of n^3, the cube above will have volume of (n-1)^3 and so on until the top which will have a volume of 1^3. You are given the total volume m of the building. Being given m can you find the number n of cubes you will have…

findNb.js

function findNb(m) {
  // create an endless loop that increments n, the cube number, starting with a value of 1  
  for ( var n = 0;;n++ ) {
    
    if ( m > 0 ) {
      // if m, the total volume, is not 0, we will subtract the volume of the current cube from it
      
      // first calculate the volume of the current cube
      var currCubeVol = Math.pow( n+1, 3);
      
      // subtract the current cube volume from the total volume
      m = m - currCubeVol;
    } else if ( m == 0 ) {
      // if m is zero then we've found our n, so return n
      return n;
    } else if ( m < 0 ) {
      // if we've gone below zero there is no such n!
      return (-1);
    }
  }  
}

very nice, thanks for the detailed explanation!

We should return n+1 if m===0 , I think