Beats 100% || Simple and Easy Code
IntuitionThe problem aims to find the maximum number of containers that can be filled, given a certain number of items, weight per item, and maximum total weigh
# Intuition
The problem aims to find the maximum number of containers that can be filled, given a certain number of items, weight per item, and maximum total weight. It involves calculating the maximum number of containers based on the number of items and the maximum number of containers based on the total weight constraint, and then returning the minimum of these two values.

# Approach
1.  Calculate the maximum number of containers that can be filled based on the number of items: `a = n * n`.
2.  Calculate the maximum number of containers that can be filled based on the maximum total weight: `b = maxWeight // w`.
3.  Return the minimum of `a` and `b`, as the actual number of containers cannot exceed either of these limits.

# Complexity
- Time complexity:
$$O(1)$$ because the operations performed are constant-time arithmetic operations.

- Space complexity:
$$O(1)$$ because we are only using a constant amount of extra space for the variables `a` and `b`.
# Code
```python3
class Solution:
    def maxContainers(self, n: int, w: int, maxWeight: int) -> int:
        a = n*n
        b = maxWeight//w
        
        return min(a, b)
['Python3']