Given an array of elements 'n'. some k<n elements are replaced by elements such that the repalced elements are <n. with o(n) find the missing elements, without wasting any extra memory.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
