1. Initialize a bit vector of size n. 2. For every no. set the corresponding bit vector. 3. Now scan through the bit vectors and get the missing numbers corressponding to the unset bits in the bit vector.
Time complexity : O(n) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
