Given you have an array A[1..n] of size n, it contains elements from the set {1..n}. However, two of the elements are missing, (and perhaps two of the array elements are rep
As you have given an array of n size and find the missing number when it's in a sequence.
#include main() { print("value of n"); scan("%d",&n); print("enter the elements"); for(i=0;i
It would find the missing when its in sequence only.