# Container With Most Water: Study Guide
Container With Most Water shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Two pointers at the ends: the area is min(height[L],height[R])*(R-L). Move the shorter wall inward, because the width shrinks and only a taller wall can improve the area.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Moving the taller wall, which can only decrease or keep the min height.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.