You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Given an array heights where each element represents the height of a line at that index, find the maximum area of water that can be contained between two lines.
Labels:
new algorithm, gssoc-ext, hacktoberfest, level1
Assignees:
Contributor in GSSoC-ext
Want to work on it
The text was updated successfully, but these errors were encountered:
Name:
[NEW ALGORITHM]
Container With Most WaterAbout:
Given an array heights where each element represents the height of a line at that index, find the maximum area of water that can be contained between two lines.
Labels:
new algorithm, gssoc-ext, hacktoberfest, level1
Assignees:
The text was updated successfully, but these errors were encountered: