No way u can do it in O(1) space and O(n) time.....sols above are not gonna work......yeah, it is possible in O(n) space and O(n) time.
On May 20, 12:29 am, HARSHIT PAHUJA <hpahuja.mn...@gmail.com> wrote: > given 2 unsorted integer arrays a and b of equal size. Determine if b is a > permutation of a. Can this be done in O(n) time and O(1) space ? > > please help me with my solution > > suppose a -- 3 5 4 > b -- 4 3 5 > > now we replace a[i] with a[i]..th prime number and b with b[i] .. th prime > number > > now array a becomes 5 11 7 > array b becomes 7 5 11 > > now we take product of elements of array a and do the same with array b > elements > if product is equal then b is a permutation of a -- 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.
