Find the one missing number in range
Last Updated :
28 Oct, 2022
Given an array of size n. It is also given that range of numbers is from smallestNumber to smallestNumber + n where smallestNumber is the smallest number in array. The array contains number in this range but one number is missing so the task is to find this missing number.
Examples:
Input: arr[] = {13, 12, 11, 15}
Output: 14
Input: arr[] = {33, 36, 35, 34};
Output: 37
The problem is very close to find missing number.
There are many approaches to solve this problem.
A simple approach is to first find minimum, then one by one search all elements. Time complexity of this approach is O(n*n)
A better solution is to sort the array. Then traverse the array and find the first element which is not present. Time complexity of this approach is O(n Log n)
The best solution is to first XOR all the numbers. Then XOR this result to all numbers from smallest number to n+smallestNumber. The XOR is our result.
Example:
arr[n] = {13, 12, 11, 15}
smallestNumber = 11
first find the xor of this array
13^12^11^15 = 5
Then find the XOR first number to first number + n
11^12^13^14^15 = 11;
Then xor these two number's
5^11 = 14 // this is the missing number
Implementation:
C++
// CPP program to find missing
// number in a range.
#include <bits/stdc++.h>
using namespace std;
// Find the missing number
// in a range
int missingNum(int arr[], int n)
{
int minvalue = *min_element(arr, arr+n);
// here we xor of all the number
int xornum = 0;
for (int i = 0; i < n; i++) {
xornum ^= (minvalue) ^ arr[i];
minvalue++;
}
// xor last number
return xornum ^ minvalue;
}
// Driver code
int main()
{
int arr[] = { 13, 12, 11, 15 };
int n = sizeof(arr)/sizeof(arr[0]);
cout << missingNum(arr, n);
return 0;
}
// Java program to find
// missing number in a range.
import java.io.*;
import java.util.*;
class GFG {
// Find the missing number in a range
static int missingNum(int arr[], int n)
{
List<Integer> list = new ArrayList<>(arr.length);
for (int i :arr)
{
list.add(Integer.valueOf(i));
}
int minvalue = Collections.min(list);;
// here we xor of all the number
int xornum = 0;
for (int i = 0; i < n; i++) {
xornum ^= (minvalue) ^ arr[i];
minvalue++;
}
// xor last number
return xornum ^ minvalue;
}
public static void main (String[] args) {
int arr[] = { 13, 12, 11, 15 };
int n = arr.length;
System.out.println(missingNum(arr, n));
}
}
//This code is contributed by Gitanjali.
# python3 program to check
# missingnumber in a range
# Find the missing number
# in a range
def missingNum( arr, n):
minvalue = min(arr)
# here we xor of all the number
xornum = 0
for i in range (0,n):
xornum ^= (minvalue) ^ arr[i]
minvalue = minvalue+1
# xor last number
return xornum ^ minvalue
# Driver method
arr = [ 13, 12, 11, 15 ]
n = len(arr)
print (missingNum(arr, n))
# This code is contributed by Gitanjali.
// C# program to find
// missing number in a range.
using System;
using System.Collections.Generic;
using System.Linq;
class GFG
{
// Find the missing number in a range
static int missingNum(int []arr, int n)
{
List<int> list = new List<int>(arr.Length);
foreach (int i in arr)
{
list.Add(i);
}
int minvalue = list.Min();
// here we xor of all the number
int xornum = 0;
for (int i = 0; i < n; i++)
{
xornum ^= (minvalue) ^ arr[i];
minvalue++;
}
// xor last number
return xornum ^ minvalue;
}
// Driver Code
public static void Main (String[] args)
{
int []arr = { 13, 12, 11, 15 };
int n = arr.Length;
Console.WriteLine(missingNum(arr, n));
}
}
// This code is contributed by Rajput-Ji
<?php
// PHP program to find missing
// number in a range.
// Find the missing number
// in a range
function missingNum($arr, $n)
{
$minvalue = min($arr);
// here we xor of all the number
$xornum = 0;
for ($i = 0; $i < $n; $i++)
{
$xornum ^= ($minvalue) ^ $arr[$i];
$minvalue++;
}
// xor last number
return $xornum ^ $minvalue;
}
// Driver code
$arr = array( 13, 12, 11, 15 );
$n = sizeof($arr);
echo missingNum($arr, $n);
// This code is contributed
// by Sach_Code
?>
<script>
// Javascript program to find missing
// number in a range.
// Find the missing number
// in a range
function missingNum(arr, n)
{
let minvalue = Math.min(...arr);
// here we xor of all the number
let xornum = 0;
for (let i = 0; i < n; i++) {
xornum ^= (minvalue) ^ arr[i];
minvalue++;
}
// xor last number
return xornum ^ minvalue;
}
// Driver code
let arr = [ 13, 12, 11, 15 ];
let n = arr.length;
document.write(missingNum(arr, n));
</script>
Time Complexity: O(n), where n is the size of the array
Auxiliary Space: O(1)
Another Approach:
An efficient approach to find out the missing number can be performed using the concept that sum of the arithmetic progression smallestNumber, smallestNumber + 1, smallestNumber + 2, ..... , smallestNumber + n, which is (n + 1) x (2smallestNumber + 1) / 2 is equal to the sum of the array + the missing number.
In other words,
Sum of the AP - Sum of the array = Missing Number.
The advantage of this method is that we can utilize the inbuilt library methods to calculate the sum and minimum number of the array, which will reduce the execution time, especially for languages like Python3 and JavaScript.
Implementation:
C++
// CPP program to find missing
// number in a range.
#include <bits/stdc++.h>
using namespace std;
// Function to find the missing number
// in a range
int missingNum(int arr[], int n)
{
// calculating the minimum of the array
int& minNum = *min_element(arr, arr + n);
// calculating the sum of the array
int arrSum = 0;
arrSum = accumulate(arr, arr + n, arrSum);
// calculating the sum of the range [min, min + n]
// given using the AP series sum formula
// (n + 1) * (2 * min + 1) / 2
int rangeSum = (minNum + minNum + n) * (n + 1) / 2;
// the difference between the sum of range
// and the sum of array is the missing element
return rangeSum - arrSum;
}
// Driver code
int main()
{
int arr[] = { 13, 12, 11, 15 };
int n = sizeof(arr) / sizeof(arr[0]);
// function call
cout << missingNum(arr, n);
return 0;
}
// this code is contributed by phasing17
// Java program to find missing
// number in a range.
import java.util.stream.*;
class GFG {
// Function to find the missing number
// in a range
static int missingNum(int[] arr, int n)
{
// calculating the minimum of the array
int minNum = IntStream.of(arr).min().getAsInt();
// calculating the sum of the array
int arrSum = IntStream.of(arr).sum();
// calculating the sum of the range [min, min + n]
// given using the AP series sum formula
// (n + 1) * (2 * min + 1) / 2
int rangeSum = (minNum + minNum + n) * (n + 1) / 2;
// the difference between the sum of range
// and the sum of array is the missing element
return rangeSum - arrSum;
}
// Driver Code
public static void main(String[] args)
{
int[] arr = { 13, 12, 11, 15 };
int n = arr.length;
// function call
System.out.println(missingNum(arr, n));
}
}
//this code is contributed by phasing17
# Python3 program to find missing
# number in a range.
# Function to find the missing number
# in a range
def missingNum(arr, n):
# calculating the minimum of the array
minNum = min(arr)
# calculating the sum of the array
arrSum = sum(arr)
# calculating the sum of the range [min, min + n]
# given using the AP series sum formula
# (n + 1) * (2 * min + 1) / 2
rangeSum = (minNum + minNum + n) * (n + 1) // 2
# the difference between the sum of range
# and the sum of array is the missing element
return rangeSum - arrSum
# Driver code
arr = [13, 12, 11, 15]
n = len(arr)
# function call
print(missingNum(arr, n))
# this code is contributed by phasing17
// C# program to find missing
// number in a range.
using System;
using System.Linq;
class GFG {
// Function to find the missing number
// in a range
static int missingNum(int[] arr, int n)
{
// calculating the minimum of the array
int minNum = arr.Min();
// calculating the sum of the array
int arrSum = arr.Sum();
// calculating the sum of the range [min, min + n]
// given using the AP series sum formula
// (n + 1) * (2 * min + 1) / 2
int rangeSum = (minNum + minNum + n) * (n + 1) / 2;
// the difference between the sum of range
// and the sum of array is the missing element
return rangeSum - arrSum;
}
// Driver Code
public static void Main(string[] args)
{
int[] arr = { 13, 12, 11, 15 };
int n = arr.Length;
// function call
Console.WriteLine(missingNum(arr, n));
}
}
// this code is contributed by phasing17
//JS program to find missing
// number in a range.
// Function to find the missing number
// in a range
function missingNum(arr, n)
{
// calculating the minimum of the array
var minNum = Math.min(...arr);
// calculating the sum of the array
var arrSum = arr.reduce((a, b) => a + b, 0);
// calculating the sum of the range [min, min + n]
// given using the AP series sum formula
// (n + 1) * (2 * min + 1) / 2
var rangeSum = Number((minNum + minNum + n) * (n + 1) / 2);
// the difference between the sum of range
// and the sum of array is the missing element
return rangeSum - arrSum;
}
// Driver code
var arr = [ 13, 12, 11, 15 ];
var n = arr.length;
// function call
console.log(missingNum(arr, n));
// this code is contributed by phasing17
Time Complexity: O(n)
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem