Let a color below represent a single character in UTF-8 encoding ,
which means that each color can span multiple bytes , In example below I
denote one byte by one english character . i.e.
'a' or 'b' or 'c' ,etc. below takes one byte :
Let the string is :
x abc def gh ij klmn
now to reverse this
is
presented in an unordered array. You need to account for the
complexity of forming the bst and how much space it will take.
Dave
On Sep 7, 7:20 pm, Himanshu Neema potential.himansh...@gmail.com
wrote:
Do reverse inorder and count number of nodes visited, Kth visited node
will
be Kth largest
Do reverse inorder and count number of nodes visited, Kth visited node will
be Kth largest.
Time : O(n)
Space : O(1)
On Mon, Sep 5, 2011 at 5:16 PM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:
@monish:
u'rs is correct , time =O(nlogn) Ok but, the constant behind this prog is
very
at 1:04 AM, Abhishek Goswami zeal.gosw...@gmail.com
wrote:
Hi,
I tried to open this book in google docs and got message that file is not
avaliable. does this file not available in google docs
if yes , can anybody share this book again
On Tue, Mar 22, 2011 at 10:41 PM, Himanshu Neema
Turns out that I cant send file larger than 4 MB , please download it from
here , let me know if you're still unable to download:
http://dl.dropbox.com/u/2681370/Algorithms%2Bfor%2BInterviews%2B%28scan%2Bocr%29%20%281%29.pdf
have fun !
On Tue, Mar 22, 2011 at 10:21 PM, Himanshu Neema
-- Forwarded message --
From: Himanshu Neema potential.himansh...@gmail.com
Date: Tue, Mar 22, 2011 at 11:13 PM
Subject: Re: [algogeeks] If any one have algorithms for interviews by adnan
aziz ebook... Please mail ...
To: Abhishek Goswami zeal.gosw...@gmail.com
Its a 15.4MB pdf
