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.
What I understand, you can pick N numbers from all the stacks together.
- prosun.csedu December 01, 2016Does the following algorithm work?
1. Maintain a Maxheap of size N (We can get maximum N numbers).
2. Initially get one value from each stack into the heap.
3. When the heap is full of size N, extract the max. If the extracted value is from stack Si, pop another value from Si and put it again into the heap.
4. Repeat 3 until get maximum N numbers.
Complexity: total 2N heap pop() and 2NLogN for heap insert and extraction.