Skip to content

Commit 4985d90

Browse files
committed
update README
1 parent 7568e5b commit 4985d90

File tree

1 file changed

+2
-0
lines changed

1 file changed

+2
-0
lines changed

README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1577,6 +1577,8 @@ func spiralOrder(_ matrix: [[Int]]) -> [Int] {
15771577

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

1580+
> *Amazon iOS Interview Question*
1581+
15801582
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])`.
15811583

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

0 commit comments

Comments
 (0)