# Java Algorithms: First Missing Positive (LeetCode)

## Too Long; Didn't Read

The First Missing Positive problem is an algorithm problem that requires finding the smallest positive integer that is not present in a given unsorted array of integers. The goal is to find the missing positive integer with the least value in the array in O(n) time complexity and O(1) space complexity. This problem can be solved by modifying the original array in-place and using the array indices to mark the presence of positive integers in the array.