Missing Smallest :
Difficulty Level : Medium
Submissions : 381
Asked In :
Marks :10
: 2 | : 0
Given an unsorted array $$$arr[]$$$ of size $$$n$$$, with both positive and negative elements, the task is to find the smallest positive number missing from the array.
Input
The first line contains two integers n, $$$(1 \le n \le 10^5)$$$, the size of the array.
The second line contains n integers, $$$(1 \le arr_i \le 10^9)$$$
Output
Return the smallest missing positive integer.
Example
Input
6 1 5 6 -2 4 2
Output
3
