Instructions in the project. See Notes & Credits to see what the project is doing.
From the challenge: Given an array of integers, find the first missing positive integer. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well.
