Add 3492_maximum_containers_on_a_ship

m3xw3ll · m3xw3ll · commit 5b9cb9081167 · 2025-03-24T13:13:18.000+01:00
diff --git a/Algorithms/3492_maximum_containers_on_a_ship.md b/Algorithms/3492_maximum_containers_on_a_ship.md
@@ -0,0 +1,34 @@
+# [Maximum Containers on a Ship](https://leetcode.com/problems/maximum-containers-on-a-ship/description/)
+
+You are given a positive integer n representing an n x n cargo deck on a ship. Each cell on the deck can hold one container with a weight of exactly w.
+
+However, the total weight of all containers, if loaded onto the deck, must not exceed the ship's maximum weight capacity, maxWeight.
+
+Return the maximum number of containers that can be loaded onto the ship.
+
+Example 1:
+```
+Input: n = 2, w = 3, maxWeight = 15
+
+Output: 4
+
+Explanation:
+
+The deck has 4 cells, and each container weighs 3. The total weight of loading all containers is 12, which does not exceed maxWeight.
+```
+Example 2:
+```
+Input: n = 3, w = 5, maxWeight = 20
+
+Output: 4
+
+Explanation:
+
+The deck has 9 cells, and each container weighs 5. The maximum number of containers that can be loaded without exceeding maxWeight is 4.
+```
+Solution
+```python
+class Solution:
+    def maxContainers(self, n: int, w: int, maxWeight: int) -> int:
+        return min(n*n, maxWeight // w)
+```
diff --git a/Algorithms/snippets/3492_maximum_containers_on_ship.py b/Algorithms/snippets/3492_maximum_containers_on_ship.py
@@ -0,0 +1,5 @@
+def max_containers(n, w, max_weight):
+    return min(n*n, max_weight // w)
+
+
+print(max_containers(n = 2, w = 3, max_weight = 15))
diff --git a/README.md b/README.md
@@ -778,7 +778,7 @@ To search for a specific problem please use ```STRG + F``` to search for.
 | 3461   | [Check If Digits Are Equal in String After Operations I](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3461_check_if_digits_are_equal_in_string_after_operations_one.md)
 | 3467   | [Transform Array by Parity](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3467_transform_array_by_parity.md)
 | 3483   | [Unique 3-Digit Even Numbers](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3483_unique_three_digit_even_numbers.md)
-
+| 3492   | [Maximum Containers on a Ship](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3492_maximum_containers_on_a_ship.md)
 
 
 ### Pandas
