441. Find Smallest Divisor Threshold

Given an array of integers nums and an integer threshold, find the smallest positive integer divisor such that the sum of the results of dividing each number in the array by this divisor is less than or equal to the threshold. Each result of division is rounded up to the nearest integer (e.g., 7/3 = 3).

Example:
Input: nums = [1,2,5,9], threshold = 6 Output: 5

Run this challenge interactively in Python or JavaScript when the app loads.