Hi friends,
http://www.iitplacementpapers.com/2012/09/directi-placement-papers-2011-2012.html
--
With Regards,
N.Vamshi Vijay,
Mtech,CSE, IIT Kharagpur,
--
the heap condition. When you are finished with the
input, the numbers in the heap will be the largest ten numbers in the file.
Dave
On Saturday, December 1, 2012 11:54:22 AM UTC-6, vamshi vijay wrote:
Hi friends
http://www.iitplacementpapers.**com/2012/09/inmobi-previous-**
placment
Hi Friends
http://www.iitplacementpapers.com/2012/09/oracle-placement-paper-2011-2012-iits.html
--
With Regards,
N.Vamshi Vijay,
Mtech,CSE, IIT Kharagpur,
Software Developer, Amazon India Development Center.
--
Hi Friends..
http://www.iitplacementpapers.com/2012/09/yahoo-campus-placement-papers-iits-nits.html
--
With Regards,
N.Vamshi Vijay,
Mtech,CSE, IIT Kharagpur,
Software Developer, Amazon India Development Center.
--
Hi friends
http://www.iitplacementpapers.com/2012/09/inmobi-previous-placment-papers.html
--
With Regards,
N.Vamshi Vijay,
Mtech,CSE, IIT Kharagpur,
Software Developer, Amazon India Development Center.
--
reverse(s); // reverse string S
reverse(1,n-k); // reverse first n-k characters
reverse(n-k+1,n) // reverse remaining
Time complexity :O(n),space : O(1)
On 10 September 2011 21:53, praveen raj praveen0...@gmail.com wrote:
Whatever changes have been made in array in first step 1 will be
@Sagar
See at level 4, 81 leaf nodes are possible, since in question it has been
given 28 leaf nodes, if i use just 10 nodes from level 3 (27 nodes), i can
get 28 leaves, but if u observe the remaining 17 nodes in the 3rd level are
also becoming leaf nodes, but in question given as 28 leaf
Let the present node be X, Crete a new node 'Y' and give X-next=Y.
Then swap(X-data,Y-data)
On 8 August 2011 09:06, Abhishek Gupta mailatabhishekgu...@gmail.comwrote:
Errata:
sorry guys..
there is a change in the problem.. actually we have to INSERT a NEW NODE
before the current pointer.
