Algorithm Search⌘K

Problemintro

Container with most water

Also called maximum area between two lines.

Choose two vertical lines that, with the x-axis, hold the most water; solvable by inward two-pointer scan.

Choose two vertical lines that, with the x-axis, hold the most water; solvable by inward two-pointer scan.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator