🔢 Day 6

Author: AkashRajpurohit

README.md

@@ -10,6 +10,7 @@
 3. [Consecutive Characters](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3518/) ➡️ [CPP Solution](Week1/maxPower.cpp)
 4. [Minimum Height Trees](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3519/) ➡️ [CPP Solution](Week1/findMinHeightTrees.cpp)
 5. [Minimum Cost to Move Chips to The Same Position](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3519/) ➡️ [CPP Solution](Week1/minCostToMoveChips.cpp)
+6. [Find the Smallest Divisor Given a Threshold](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3520/) ➡️ [CPP Solution](Week1/smallestDivisor.cpp)
 
 ## Week 2 🚧
 Coming soon...

Week1/smallestDivisor.cpp

@@ -0,0 +1,25 @@
+class Solution {
+public:
+    int smallestDivisor(vector<int>& nums, int threshold) {        
+        int left = 1, right = 1e6;
+        int sum = 0;
+        int mid, ans;
+        
+        while(left <= right) {
+            mid = left + (right - left) / 2;
+            sum = 0;
+            
+            for(int num: nums)
+                sum += ceil((float)(num) / (float)(mid));
+            
+            if(sum <= threshold) {
+                ans = mid;
+                right = mid - 1;
+            } else {
+                left = mid + 1;
+            }
+        }
+        
+        return ans;
+    }
+};