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.
can't we use doubly linked list.Once i reached the last node .I'll try to see if it is the min element
- singhvivekpes July 22, 2014and if it is .
8<->9<->7<->K<->6<->3<->4<->1
Go back to 4 and delete the element. and print it
8<->9<->7<->K<->6<->4 . now since 4 is not the min element . First Go back and now my pointer will point to 3. and Remove the element and add to the head of the list i.e
4<->8<->9<->7<->K<->6<->3
now keep repeating it for the Element which are not the min. And stop when only king remains.
But I am not sure about the time. Can somebody tell me if this approach is correct or not.if it is what will be the time complexity
thanks in advance