Lol what? He used sort which is a built in function, also his solution is O(nlogn) when the optimal solution is O(n)

Because it's local scope variable as well. So u can do whatever u want with it

Without 'use strict' this will work

100 actually

If not for the comments on the codewars site, who would have let me know it was possible to learn that you can learn that people learned this here?

bounce 0.66 is multiplier which change value of h bounce times (*0.66) with each bounce

dirs is an accumulator which has been initialized as []

bitwise shift to the left

Without bounce, you don't know the rate of change for the height, so theres no way for you to calculate the number of times it will bounce to a height that is higher than the window

It would bounce back to 2/3s of its starting height. Then 2/3s of the peak of the next bounce.