Skip to content

Commit

Permalink
update README
Browse files Browse the repository at this point in the history
  • Loading branch information
lgreydev committed Jan 24, 2022
1 parent 7568e5b commit 4985d90
Showing 1 changed file with 2 additions and 0 deletions.
2 changes: 2 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -1577,6 +1577,8 @@ func spiralOrder(_ matrix: [[Int]]) -> [Int] {

### [Container With Most Water](https://github.com/lgreydev/Help/blob/master/Help/LeetCode/ContainerWithMostWater.swift)

> *Amazon iOS Interview Question*

You are given an integer array `height` of length `n`. There are n vertical lines drawn such that the two endpoints of the `ith` line are `(i, 0)` and `(i, height[i])`.

Find two lines that together with the x-axis form a container, such that the container contains the most water.
Expand Down

0 comments on commit 4985d90

Please sign in to comment.