README ¶ NAME container - largest container PROBLEM Consider an array of heights {hi}. A container is a box, formed from two heights at indices i and j and respective heights hi and hj. It's volume is defined as: min(hi, hj) * (j - i) Find a box with maximum volume and return the volume value. EXAMPLE Input: [1, 2, 3] Output: 2 SEE ALSO Solution Expand ▾ Collapse ▴ Documentation ¶ Overview ¶ Example ¶ package main import ( "fmt" "github.com/skhal/lab/iq/4/container" ) func main() { fmt.Println(container.Find([]int{1, 2, 3})) } Output: 2 Share Format Run Index ¶ type Volume func Find(nn []int) Volume Examples ¶ Package Constants ¶ This section is empty. Variables ¶ This section is empty. Functions ¶ This section is empty. Types ¶ type Volume ¶ type Volume int const VolumeEmpty Volume = 0 func Find ¶ func Find(nn []int) Volume Source Files ¶ View all Source files solution.go Click to show internal directories. Click to hide internal directories.