Given an array of size n-1 containing unique numbers from the range 0 to n, find the two missing numbers. The solution must run in O(n) time and O(1) auxiliary space.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.