LeetCode: 41. First Missing Positive

Problem: 41. First Missing Positive

Link: https://leetcode.com/problems/first-missing-positive/

Algorithm: https://www.youtube.com/watch?v=PZfP3Q-K4ho

Difficulty: Hard

Description:

Given an unsorted integer array, find the smallest missing positive integer.

Example 1:

Input: [1,2,0] Output: 3

Example 2:

Input: [3,4,-1,1] Output: 2

Example 3:

Input: [7,8,9,11,12] Output: 1

Solution: 

Language: Swift

Runtime: 12ms
Memory: 18.9MB