One Repeating And One Missing

easy

Bit Manipulation

Question Solve Solutions

1. You are given an array of length n containing numbers from 1 to n.
2. One number is present twice in array and one is missing.
3. You have to find these two numbers.

Input Format

A number n a1 a2.. n numbers

Output Format

Missing number Repeating Number

Constraints

1 &lt;= n &lt;= 10^9
1 &lt;= a1,a2.. &lt;= 10^9

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

Missing Number -> 7
Repeating Number -> 1

All Repeating Three Times Except One

Flip Bits To Convert A To B

Related Questions

easy Gray Code easy Basics Of Bit Manipulation easy Print Value Of Rsb Mask easy Kernighans Algorithm easy All Repeating Except One easy All Repeating Except Two easy All Repeating Three Times Except One easy Flip Bits To Convert A To B easy Copy Set Bits In A Range easy Check Divisibility By 3 easy Print Binary And Reverse Bits easy Count Set Bits In First N Natural Numbers easy Is A Power Of 2 easy Solve 7n By 8 easy Swap All Odd And Even Bits easy Sum Of Bit Differences Of All Pairs