@Sachin Chitale : Very good approach dude . thumbs up +1 -- Arun Singh Chauhan Engineer (RnD 2), Samsung Electronics Software Engineering Lab, Noida
On Tuesday, February 12, 2013 11:44:08 PM UTC+5:30, Sachin Chitale wrote: > > use ex-or operation for all array elements.. > a^a=0 > a^a^a=a > > > On Sun, Feb 10, 2013 at 8:22 AM, Mohanabalan D B > <[email protected]<javascript:> > > wrote: > >> can use counting sort >> >> >> On Sun, Jul 15, 2012 at 6:37 PM, santosh thota >> <[email protected]<javascript:> >> > wrote: >> >>> If we can retrieve ith prime efficiently, we can do the following... >>> 1.maintain a prod=1, start from 1st element, say a[0]=n find n th prime >>> 2.check if (prod% (ith_prime * ith_prime )==0) then return i; >>> else prod=prod*ith_prime; >>> 3.repeat it till end >>> >>> >>> >>> On Thursday, 12 July 2012 10:55:02 UTC+5:30, algo bard wrote: >>> >>>> Given an array of integers where some numbers repeat once, some numbers >>>> repeat twice and only one number repeats thrice, how do you find the >>>> number >>>> that gets repeated 3 times? >>>> >>>> Does this problem have an O(n) time and O(1) space solution? >>>> No hashmaps please! >>>> >>> -- >>> You received this message because you are subscribed to the Google >>> Groups "Algorithm Geeks" group. >>> To view this discussion on the web visit >>> https://groups.google.com/d/msg/algogeeks/-/TSPSKlD0FDsJ. >>> >>> To post to this group, send email to [email protected]<javascript:> >>> . >>> To unsubscribe from this group, send email to >>> [email protected] <javascript:>. >>> 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 unsubscribe from this group and stop receiving emails from it, send an >> email to [email protected] <javascript:>. >> For more options, visit https://groups.google.com/groups/opt_out. >> >> >> > > > > -- > Regards, > Sachin Chitale > Application Engineer SCJP, SCWCD > Contact# : +91 8086284349, 9892159511 > Oracle Corporation > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
