Roger's Code Journey

Link to code challenge function equalizeArray(arr) { let count = {}; let greatest = 1; for (let num of arr) { if (count.hasOwnProperty(num)) { count[num]++; if (count[num] > greatest) greatest = count[num]; } else count[num] = 1; } return arr.length - greatest; }

Link to code challenge function cutTheSticks(arr) { let sticksLeft = []; while (arr.length > 0) { sticksLeft.push(arr.length); arr.sort((a, b) => b - a); let lowest = arr[arr.length - 1]; for (let i = arr.length - 1; i >= 0; i--) { if (arr[i] === lowest) arr.splice(i, 1); else arr[i] -= lowest; } } return sticksLeft; }