@Dipankar:
thanks a lot.
Thank you,
Siddharam
On Fri, Aug 5, 2011 at 10:47 AM, Dipankar Patro wrote:
> @ Sidharam:
> Best of Luck for the interviews. I hope you crack it!
> Normal Algo and OS questions will be asked. I don'y think you need any
> advice, you will do just fine.
>
> On 5 August 20
@ Sidharam:
Best of Luck for the interviews. I hope you crack it!
Normal Algo and OS questions will be asked. I don'y think you need any
advice, you will do just fine.
On 5 August 2011 10:38, Arun wrote:
> @Sidharam
> Sorry!
> I just missed a point.It should be fine.
>
> On Aug 5, 10:00 am, sidd
@Sidharam
Sorry!
I just missed a point.It should be fine.
On Aug 5, 10:00 am, siddharam suresh wrote:
> @ toarunb...@gmail.com:
> can you tell me flaw in algo(or sample input)!
> Thank you,
> Siddharam
>
>
>
>
>
>
>
> On Fri, Aug 5, 2011 at 10:28 AM, Arun wrote:
> > @Sidharam
>
> > I dont think
@ toarunb...@gmail.com:
can you tell me flaw in algo(or sample input)!
Thank you,
Siddharam
On Fri, Aug 5, 2011 at 10:28 AM, Arun wrote:
> @Sidharam
>
> I dont think your idea goes along with the sample i/p & o/p
>
> On Aug 5, 9:35 am, siddharam suresh wrote:
> > my idea is "go for inorder tra
@Sidharam
I dont think your idea goes along with the sample i/p & o/p
On Aug 5, 9:35 am, siddharam suresh wrote:
> my idea is "go for inorder traversal find the longest sorted sequence in
> traversal thats the *'largest BST in a binary tree.'* "
> Thank you,
> Siddharam
>
>
>
>
>
>
>
> On Fri, A
