Learn and practice the Two Pointers, Fast and Slow Pointers, and Modified Binary Search patterns to solve coding interview problems.

Speedrun the Apple Coding Interview: Top Problems in Go

This module groups together three of the most common patterns that may be used to solve problems where the input data is linear: Two Pointers, Fast and Slow Pointers, and Modified Binary Search. Both the Two Pointers and the Modified Binary Search patterns derive their power from their ability to efficiently reduce the size of the search space, that is, both exemplify the divide-and-conquer approach to problem-solving. The Fast and Slow Pointers pattern may be considered a variant of the Two Pointers pattern, where the two pointers move at different speeds in order to traverse the input list in a way that solves the given problem. After completing this module, we will have learned how to use this set of related patterns to solve a diverse range of problems.

Two Pointers & Co.

#
## Statement

You're given an integer array `height` of length $n$, and 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 from the input array that, together with the x-axis, form a container that holds as much water as possible. Return the maximum amount of water a container can store.

> **Note:** You may not slant the container.

**Constraints:**

- $n =$ `height.length`

- $2 \leq$ $n$ $\leq 10^3$

- $0 \leq$ `height[i]` $\leq 10^3$

## Examples

Try to solve the Container with Most Water problem.

Container With the Most Water

Statement