For an unsorted array of integers in a given range, find the smallest missing positive integer
Anonymous
register every number in the array on a ledger array using some hash then find which number in range given is missing, O(n) time and O(1) space.
Check out your Company Bowl for anonymous work chats.