# Problem Definition

## Description

Given an array of integers, return the highest product possible by multiplying 3 numbers from the array

**Input:**

```plaintext
array of integers e.g {1, 2, 3}
```

NOTE: Solution will fit in a 32-bit signed integer.

**Example:**

```plaintext
[0, -1, 3, 100, 70, 50]

=> 70*50*100 = 350000
```

## Notes

1. [angshukutu - InterviewBit: Greedy](https://angshukutu.wordpress.com/2016/02/20/interviewbit-greedy/)