First Missing Positive Integer Solution

Problem Statement

Given an array of integers `arr` and an integer `k`, find the first missing positive integer such that each of the first `k` positive integers appear exactly once, and `arr` contains some, possibly none, of these positive integers.

Constraints

• 1 <= nums.length <= 100
• 1 <= k <= 100
• -1000 <= nums[i] <= 1000
• Given array contains at most 3*k different integers.

More Arrays Problems