in an earlier post there was a discussion in which a person had asked to find the duplicate element in an array of integers in o(n) time and o(1) space... there was a solution using xor that was provided if all numbers in the range from 1-n with one repeating element were present in the array.
anyways, what is the effective method to find 1) given an array with any set of positive integers , to find the duplicated element? 2)if array has negative and positive integers now, would the algo differ? 3)to find an element that has been repeated k times? -- "People often say that motivation doesn't last. Well, neither does bathing - that's why we recommend it daily." -- 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.
