Time complexity

Question

Comments

Well explanation bro @shaikmasthan

---

we can't apply binary search, due to array is not sort.

But we know that n is fixed ===> apply counting sort ==> O(n)

then again with a for loop, we can know which is missing ===> O(n)

O(n)+O(n) = O(n)

---

XOR method is also interesting-

https://www.geeksforgeeks.org/find-the-missing-number/