1)Find product of the array and store it in say prod ---- o(n) and o(1) 2)now traverse the array and check if static int i; tag: while(i<n) if( prod %(ar[i]*arr[i]*arr[i] ) ==0) break; //this may be the required element //e-o-while //now check is this is the element that is occuring three times ----o(n) if(number is not the required one then) goto tag;
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/-/mzyzKs4UkjUJ. 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.
