Differentivity/SmallestPositiveMissingNumber.cpp at main · 04018002718/Differentivity · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//cpp code to find smallest positive number missing from the array
//hacktoberfest2021

#include<bits/stdc++.h>
using namespace std;


 // } Driver Code Ends


class Solution
{
    public:
    //Function to find the smallest positive number missing from the array.
    int missingNumber(int arr[], int n)
    {
        // Your code here
        const int N = 1e6+2;
        int check[N];
        for(int i=0; i<N; i++){
            check[i] = 0;
        }
        for(int i=0; i<n; i++){
            if(arr[i]>0){
                check[arr[i]] = 1;
            }
        }
        int ans = -1;
        for(int i=1; i<N; i++){
            if(check[i] == 0){
                ans = i;
                break;
            }
        }
        return ans;
    }
};

// { Driver Code Starts.

int missingNumber(int arr[], int n);

int main() {

    //taking testcases
    int t;
    cin>>t;
    while(t--){

        //input number n
        int n;
        cin>>n;
        int arr[n];

        //adding elements to the array
        for(int i=0; i<n; i++)cin>>arr[i];

        Solution ob;
        //calling missingNumber()
        cout<<ob.missingNumber(arr, n)<<endl;
    }
    return 0;
}   // } Driver Code Ends