@Srinivas, Your algorithm seems to fail on A = {0,1,-1), B =
(0,2,-2).
Dave
On Aug 18, 10:53 pm, srinivas reddy <[email protected]> wrote:
> add one more thing to the solution suggested by nikhil i.e;count the number
> of elements in array 1 and number of elements in array2 if these two values
> are equal then after follow the algo proposed by nikhil agarwal..
>
>
>
> On Wed, Aug 18, 2010 at 8:50 PM, Rais Khan <[email protected]> wrote:
> > @Chonku: Your algo seems to fail with following input.
> > Arr1[]= {1,6}
> > Arr2[]={7}
>
> > On Wed, Aug 18, 2010 at 8:42 PM, Rais Khan <[email protected]>wrote:
>
> >> @Nikhil: Your algo seems to fail with following input. What do you say?
> >> Arr1[]= {1,2,3}
> >> Arr2[]={6}
>
> >> On Wed, Aug 18, 2010 at 7:17 AM, Nikhil Agarwal <
> >> [email protected]> wrote:
>
> >>> Sum all the elements of both the arrays..let it be s1 and s2
> >>> Multiply the elements and call as m1 and m2
> >>> if(s1==s2) &&(m1==m2)
> >>> return 1;else
> >>> return 0;
>
> >>> O(n)
>
> >>> On Tue, Aug 17, 2010 at 11:33 PM, amit <[email protected]> wrote:
>
> >>>> Given two arrays of numbers, find if each of the two arrays have the
> >>>> same set of integers ? Suggest an algo which can run faster than NlogN
> >>>> without extra space?
>
> >>>> --
> >>>> You received this message because you are subscribed to the Google
> >>>> Groups "Algorithm Geeks" group.
> >>>> To post to this group, send email to [email protected].
> >>>> To unsubscribe from this group, send email to
> >>>> [email protected]<algogeeks%2bunsubscr...@googlegroups.com>
> >>>> .
> >>>> For more options, visit this group at
> >>>>http://groups.google.com/group/algogeeks?hl=en.
>
> >>> --
> >>> Thanks & Regards
> >>> Nikhil Agarwal
> >>> Senior Undergraduate
> >>> Computer Science & Engineering,
> >>> National Institute Of Technology, Durgapur,India
> >>>http://tech-nikk.blogspot.com
> >>>http://beta.freshersworld.com/communities/nitd
>
> >>> --
> >>> You received this message because you are subscribed to the Google Groups
> >>> "Algorithm Geeks" group.
> >>> To post to this group, send email to [email protected].
> >>> To unsubscribe from this group, send email to
> >>> [email protected]<algogeeks%2bunsubscr...@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 [email protected].
> > To unsubscribe from this group, send email to
> > [email protected]<algogeeks%2bunsubscr...@googlegroups.com>
> > .
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.- Hide quoted text -
>
> - Show quoted text -
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
