Good thinking. Note that this is the bitmap solution I described. You're just storing the bitmap in the sign bits of the input.
On Nov 26, 12:12 pm, bharath sriram <bharath.sri...@gmail.com> wrote: > *Assumptions*: > - All positive elements in the array > - All elements in array are in range 0 to (n-1) [ n - # of elements] > > 1) Scan the array. For every element A[i], negate the value stored in > A[A[i]]. > 2) If you encounter an element already negated, then that represents the > duplicate element. > > On Thu, Nov 24, 2011 at 12:02 AM, kumar raja <rajkumar.cs...@gmail.com>wrote: > > > > > In the given array all the elements occur single time except one element > > which occurs 2 times find it in O(n) time and O(1) space. > > > e.g. 2 3 4 9 3 7 > > > output :3 > > > If such a solution exist can we extend the logic to find "All the repeated > > elements in an array in O(n) time and O(1) space" > > > -- > > Regards > > Kumar Raja > > M.Tech(SIT) > > IIT Kharagpur, > > 10it60...@iitkgp.ac.in > > > -- > > 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. -- 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.
