Java Solution
IntuitionApproachComplexity
Time complexity:
O(n)
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:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
O(n)

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

# Code
```java []
class Solution {
    public int maxContainers(int n, int w, int maxWeight) {
        int containers = n * n;
        int currWeight = 0;
        int occupiedContainer = 0;
        while(occupiedContainer < containers){
            if(currWeight + w <= maxWeight) {
                currWeight += w;
                occupiedContainer++;
            }else{
                return occupiedContainer;
            }

        }
        return occupiedContainer;
    }
}
```
['Java']