Question bank › Bit Manipulation
Dsa Bit Manipulation Medium

Find the Missing Positive Integer

You are given an array with N integers that are all positive and distinct but one integer is missing from 1 to N. Write a program to identify the missing integer using bitwise operations. Input format: - The first line contains an integer N (1 <= N <= 100). - The second line contains N-1 space-separated integers (the input range is 1 to N). Output format: - Print the missing integer. Example: Input: 5 1 2 3 5 Output: 4

Key concepts

bitmanipulationmissingnumber

Practise this out loud — free

Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.

🎙 Practise this question now
Part of InterviewLab's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.