^+1 On Mon, Sep 12, 2011 at 11:41 PM, Ankuj Gupta <ankuj2...@gmail.com> wrote:
> Is there any restriction on the input like they are in given range ? > > On Sep 11, 11:10 pm, Neha Singh <neha.ndelhi.1...@gmail.com> wrote: > > You are given an array that contains integers. The integers content is > such > > that every integer occurs 3 times in that array leaving one integer that > > appears only once. > > Fastest way to find that single integer > > eg: > > Input: [2,1,4,5,1,4,2,2,4,1] > > Answer: 5 > > > > The solution must be of O(n) time and O(1) space > > -- > 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.
