Hi Dave,
I don't think ur logic will cover all cases like (1,1)(-3,-3), (1,1)
(2,2) a line connecting these points passes through origin,
i think the solution is, we need to compute the slope of the point at index
i with origin and build a binary tree with theses slopes.
but worst cases
On Wed, Feb 23, 2011 at 9:34 AM, vinay reddy gvina...@gmail.com wrote:
Hi Anurag,
I have taken that online test there were 3 questions ...
1. given a linked list check if it is a palindrome.
2.given two sorted arrays a[m] b[2*m], each contains m elements only. You
need to merge those two arrays
Hi Anurag,
I have taken that online test there were 3 questions ...
1. given a linked list check if it is a palindrome.
2.given two sorted arrays a[m] b[2*m], each contains m elements only. You
need to merge those two arrays into second array b[2*m]
3. construct a Binary tree from a given
