// Binary search
var smallestDivisor = function(nums, threshold) {
    // Add result of each item in nums divied by mid to sum and check if sum <= threshold
    function checkCondition(mid){
        let sum = 0
        for(const num of nums) {
            sum+=Math.ceil(num/mid)
        }
        return sum <= threshold
    }
    // Lowest possible number can be 1 and the highest number can be the max of nums
    let left = 1, right = Math.max(...nums) 
    // Binary search template
    while(left < right) {
        const mid = left + Math.floor((right-left)/2)
        if(checkCondition(mid)) right = mid
        else left = mid+1
    }
    return left
};