Hey Geeks, Though there are multiple algo to find an element but with a complexity of O(N), How to find NON-repetitive element from an array also best effective memory/space complexity as well.
Lets say an array is A{1, 1024, 2 , 1, 2, 3, 4, 4 } The output has to be foundout "3" with complexity n. *Subhransu Panigrahi * *Mobile:* *+91-9840931538* *Email:* subhransu.panigr...@gmail.com -- 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.