is a comprehensive book walking you through every aspect of getting a job at a top tech company, while focuses on software engineering interviews.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
- Anonymous on July 26, 2012 Edit | Flag Reply//O(n) approach 1> count the no. of node in Max Heap. 2> Increase the Size by one and find the binary representation of Size. 3> Ignore the MSB bit and start from MSB+1 bit . 3.1> If 0 come then move to left otherwise right. 3.2> Simultaneously you can find if (root->data > new_data) then swap the content 4>This will go continue till you reach the LSB of Binary Representation. 5>And That is The place where new node shoud be inserted