๐ฉโ๐ซ
๐จโ๐ผ
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Free ยท No sign up ยท Early access
1Container With Most Watermedium
2Part 2
3Part 3
Start Part 1 to unlock your next challenge
Based onLeetCode
mediumBlind 75
Container With Most Water
You're looking for two lines that hold the most water between them. The brute force checks every pair, but interviewers want to see you discover the two-pointer insight: start wide, then shrink inward by moving the shorter line. It's a beautiful example of greedy reasoning that comes up in many optimization problems.
Arrays & HashingTwo PointersGreedy
๐ฉโ๐ซ
๐จโ๐ผ
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Free ยท No sign up ยท Early access
1Container With Most Watermedium
2Part 2
3Part 3
Start Part 1 to unlock your next challenge
Based onLeetCode
Get this problem sent to your inbox