dpalmasan / dpalmasan/code-challenges
Container con mayor cantidad de agua
Open
arrays
- Dominant language
- Python
- Stars
- 43
- Forks
- 5
- PR merge metrics
- No merged PRs in 30d
Description
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.
Notice that you may not slant the container.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.