Maximum Containers on a Ship - Solution & Explanation

Problem Overview: You are given the number of container slots available on a ship and the ship's total weight capacity. Each container has the same weight. The task is to compute the maximum number of containers that can be loaded without exceeding either the slot limit or the total weight capacity.

Approach 1: Direct Mathematics (O(1) time, O(1) space)

This problem reduces to a simple constraint comparison. The ship can only hold a limited number of containers because of two independent constraints: the number of available slots on the deck and the maximum weight capacity. First compute the total slot capacity (for example rows * cols if the ship deck is modeled as a grid). Then compute how many containers the ship can support based on weight using maxWeight / containerWeight. The final answer is the smaller of these two values because both constraints must be satisfied.

The key insight is that no simulation or iteration is required. Both constraints are independent and can be evaluated with basic arithmetic. Once you calculate the slot limit and the weight-based limit, you simply return min(slotCapacity, weightLimitContainers). This is why the solution belongs to the Math category rather than requiring any complex data structure or algorithm.

This constant-time computation is optimal. Regardless of input size, the algorithm performs only a few arithmetic operations and a single comparison. The time complexity remains O(1) and the space complexity is also O(1) since no additional memory structures are used.

Problems like this commonly appear in interview rounds to test whether you recognize when a problem can be simplified into a direct mathematical formula rather than writing unnecessary loops or simulations. Recognizing these patterns is a useful skill in mathematical reasoning and basic constraint-based optimization.

Recommended for interviews: The mathematical formula approach is exactly what interviewers expect. A brute-force simulation of filling containers would technically work but would introduce unnecessary iteration. Demonstrating that you can reduce the problem to min(totalSlots, maxWeight / containerWeight) shows strong problem decomposition and mathematical reasoning.