is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
how abt maintaining a 10-ary ordered tree (something on the lines of a BST) ? Will have to maintain at most 9 such trees(each corresponding to numbers starting with 1,2,3,.....,9). each node of the tree will correspond to some number(not necessary in case of root of the tree)
- prakhar December 29, 2007after umbers have been plotted in this tree, a customized inorder traversal, will give the sorted result. The order will be O(n), n is the total number of numbers.
The insertion into the tree will be in order of log(n), so the
O(n) < total complexity < nlog(n)
space complexity might be an issue if there are too many numbers