Container with most water
Given an array of heights, pick two lines that together with the x-axis form a container holding the most water. Return that maximum area.
Implement
max_area(height: list[int]) → intExamples
in
[[1,8,6,2,5,4,8,3,7]]out49What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,8,6,2,5,4,8,3,7]]49not run yetsample