Given an array that does not contain duplications {0, 1, 2, 3, 4,...} and is not necessarily sorted, what is the easiest/fastest solution to find the first missing number in
