one liner super easy
Intuitionmax of contanier present and container that can holdApproachn*n = max container presentComplexity
Time complexity:
# Intuition
max of contanier present and container that can hold

# Approach
n*n = max container present

# Complexity
- Time complexity:
$$O(1)

- Space complexity:
O(1)

# Code
```python3 []
class Solution:
    def maxContainers(self, n: int, w: int, maxWeight: int) -> int:
        ans1= maxWeight //w
        return  min(n*n, int(ans1))
        
```
['Python3']