# Question 1
You are given an integer array height of length $n$. There are n vertical lines drawn such that the two endpoints of the $i_{th}$ 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.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

### Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

### Example 2:
Input: height = [1,1]
Output: 1

# Question 2
Design a stack that supports push, pop, top and retrieve the minimum element in O(1) time.

class MinStack:
    def __init__(self):
        pass
    
    def push(self, val: int) -> None:
        pass
    
    def pop(self) -> None:
        pass
    
    def top(self) -> int:
        pass
    
    def get_min(self) -> int:
        pass

### Example 1:

Input
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[0],[-3],[],[],[],[]]

Output
[null,null,null,null,-3,null,0,-2]

Explanation
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); // return -3
minStack.pop();
minStack.top(); // return 0
minStack.getMin(); // return -2