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.
I have thought of one approach, it is simple so i am thinking i must be missing something. Please break it for me:
- write.to.anuj November 05, 2012Steps:
1) Sort the array in non-decreasing order
2) Make 2 min-queue, let's name them q1,q2
3) 2 variable s1,s2 to keep running sum of both queue elements
4) start from the end of array assign the number to a queue which will make |s1-s2| minimum, in case of tie just insert element in q1
5) so in the end we will have elements in 2 queue such that the diff of sum is minimum ( as this is how we partitioned till now)
6) now shift |e1-e2|/2 elements from min-queue which has more elements to min-queue which has less element.
we are done-------------please comment on this as i am stuck to crash this approach for a test case.