- C++ Basics
- C++ Home
- C++ Overview
- C++ Environment Setup
- C++ Basic Syntax
- C++ Comments
- C++ Data Types
- C++ Variable Types
- C++ Variable Scope
- C++ Constants/Literals
- C++ Modifier Types
- C++ Storage Classes
- C++ Operators
- C++ Loop Types
- C++ Decision Making
- C++ Functions
- C++ Numbers
- C++ Arrays
- C++ Strings
- C++ Pointers
- C++ References
- C++ Date & Time
- C++ Basic Input/Output
- C++ Data Structures

- C++ Object Oriented
- C++ Classes & Objects
- C++ Inheritance
- C++ Overloading
- C++ Polymorphism
- C++ Abstraction
- C++ Encapsulation
- C++ Interfaces

# Write a program in C++ to find the missing positive number in a given array of unsorted integers

Let’s suppose we have given an array of unsorted integers. The task is to find the positive missing number which is not present in the given array in the range [0 to n]. For example,

**Input-1** −

N = 9 arr = [0,2,5,9,1,7,4,3,6]

**Output** −

8

**Explanation** − In the given unsorted array, ‘8’ is the only positive integer that is missing, thus the output is ‘8’.

**Input-2 ** −

>N= 1 arr= [0]

**Output** −

1

**Explanation** − In the given array, ‘1’ is the only positive integer that is missing, thus the output is ‘1’.

## Approach to solve this problem

There are several approaches to solve this particular problem. However, we can solve this problem in linear time O(n) and constant space O(1).

Since we know that our array is of size n and it contains exactly elements in the range of [0 to n]. So if we do XOR operation of each of the elements and its index with ‘n’, then we can find the resultant number as a unique number that is missing from the array.

Take Input of N size of the array with elements in the range [0 to n].

An integer function findMissingNumber(int arr[], int size) takes an array and its size as input and returns the missing number.

Let’s take

**n**as a missing number to perform XOR operation.Iterate over all the array elements and perform XOR operation with each of the array elements and its indexes with respect to missing number, i.e.,

**n**.Now return the missing number.

## Example

#include<bits/stdc++.h> using namespace std; int findMissingNumber(int *arr, int size){ int missing_no= size; for(int i=0;i<size;i++){ missing_no^= i^arr[i]; } return missing_no; } int main(){ int n= 6; int arr[n]= {0,4,2,1,6,3}; cout<<findMissingNumber(arr,n)<<endl; return 0; }

## Output

If we will run the above code then it will print the output as,

5

If we perform the XOR operation with each of the elements of the array and its indexes, it will print ‘5’ which is missing from the array.

- Related Articles
- Write a program in Java to find the missing positive number in a given array of unsorted integers
- Find the Smallest Positive Number Missing From an Unsorted Array
- Write a program in C++ to find the maximum and second maximum in a given unsorted array of integers
- Program to find kth missing positive number in an array in Python
- Write a program in C++ to find the most frequent element in a given array of integers
- Java Program to sort integers in unsorted array
- Write a program in Python to find which column has the minimum number of missing values in a given dataframe
- How to find the missing number in a given Array from number 1 to n in Java?
- Finding the largest and smallest number in an unsorted array of integers in JavaScript
- Write a program in C++ to find the top K frequent element in an array of integers
- PHP program to find the numbers within a given array that are missing
- Write a Golang program to find duplicate elements in a given array
- k-th missing element in an unsorted array in C++
- Program to find first positive missing integer in range in Python
- Write a Golang program to find the factorial of a given number (Using Recursion)