Menu

Tech

English

Smallest Positive Missing

Lesson 16 of 26 in Coddy's Arrays in C++ course.

Challenge

Given an array of size n-1 consisting of different integers ranging from 1 to n (both inclusive), find the smallest positive number missing from the array.

For Example,

n=5;
Arr[]={1, 2, 4, 5};

Here the smallest missing integer is 3.

Try it yourself

#include<iostream>
using namespace std;

int main(){
int n;
cin>>n;
int arr[n-1];
for(int i=0;i<n-1;i++){
    cin>>arr[i];
}

  //Write your code here 
  

  
  

    return 0;
}

All lessons in Arrays in C++

1Introduction to Arrays

Introduction Operating an Array

4Time Complexity Analysis

Time complexity Types of Time complexities

7Array Challenges

Reverse an ArraySmallest Positive MissingTranspose of Matrix Addition of Two Matrix Max and Min Element Check Palindrome

2Memory Analysis

Memory Allocation

5Searching in an Array

Linear Search Binary Search Searching in 2D Array

8Subarray

Introduction Subsequence Printing all Subarrays Subarray with given sum Cumulative sum of Subarray Kadane's Algorithm

3Types of Arrays

Arrays of different data types 1 Dimensional & 2 Dimensional Character Array

6Sorting of an Array

Simple sorting Bubble Sort Insertion Sort