Easy Solution  ||  Java  ||  Python  ||  C++  ||   🚀🚀  ||  🔥🔥
IntuitionApproachComplexity
Time complexity: O(1)

Space complexity: O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity: O(1)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity: O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int maxContainers(int n, int w, int maxWeight) {
        int ans = 0;
        n*=n;
        
        while(n*w>maxWeight){
            n-=1;
        }
        
        return n;
    }
}
```
```python []
class Solution:
    def maxContainers(self, n: int, w: int, maxWeight: int) -> int:
        n *= n
        
        while n * w > maxWeight:
            n -= 1
        
        return n

```
```C++ []
class Solution {
public:
    int maxContainers(int n, int w, int maxWeight) {
        int ans = 0;
        n *= n;
        
        while (n * w > maxWeight) {
            n -= 1;
        }
        
        return n;
    }
};

```

['Java']