Added minimized maximum solution

README.md

@@ -250,6 +250,7 @@ programming challenges completed in other languages.
 - Most Beautiful Item for Each Query (https://leetcode.com/problems/most-beautiful-item-for-each-query)
 - Count Number of Fair Pairs(https://leetcode.com/problems/count-the-number-of-fair-pairs)
 - Sum of Square Numbers (https://leetcode.com/problems/sum-of-square-numbers)
+_ Minimized Maximum of Products Distributed to Any Store (https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store)
 
 #### Hard
 

src/leetcode/minimized_maximum.rs

@@ -0,0 +1,22 @@
+pub fn minimized_maximum(n: i32, quantities: Vec<i32>) -> i32 {
+    let (mut left, mut right) = (1, 100_000);
+    while left < right {
+        let mid = (left + right) / 2;
+        let sum = quantities.iter().map(|q| (q + mid - 1) / mid).sum::<i32>();
+        match sum > n {
+            true => left = mid + 1,
+            false => right = mid,
+        }
+    }
+    left
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn finds_the_minimized_maximum_products_per_store() {
+        assert_eq!(3, minimized_maximum(6, vec![11, 6]))
+    }
+}

src/leetcode/mod.rs

@@ -97,3 +97,4 @@ mod duplicate_file;
 mod max_beauty;
 mod count_fair_pairs;
 mod square_numbers;
+mod minimized_maximum;