The Water Collector
A hard Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- hard
- Seniority
- L5
Interview Prompt
Given a list of non-negative integers representing wall heights, find two walls (by index) that together with the x-axis form a container holding the maximum amount of water. Water volume between walls at i and j is min(heights[i], heights[j]) * (j - i). Return that maximum volume.
Summary
Two walls, one sky, and a very important question.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision