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.
The idea is we need to have minimum possible value at most significant digit
- randomlearner March 19, 2015so get the minimum of first n most significant digits, print it out.
then get the minimum of next n digits, print the it out.
and so on keep sliding the window of size n and keep printing the minimum till the end.
1. For 1 to n
a.insert in the list if current element greater than head of the list.
b.otherwise keep popping the head unless list empty or head is smaller and then insert.
2. For each subsequent element.
a. pop and print the tail of list.
b. insert current element as descirbed in step 1b.