Easiest C++ | O(1) | Just 2 Lines | Explained 
IntuitionApproachComplexity
Time complexity:

Space complexity:
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)$$ -->

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

# Code
```cpp []
class Solution {
public:
    int maxContainers(int n, int w, int maxWeight) {
        // This finds the maximum container we can load
        int d=maxWeight/w;
        // now we return min of d and the total container that is n*n
        return min(d,n*n);
    }
};
```
['C++']