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 think this solution[ O(n) ] is better than greedy approach [O(log n)] (because of sorting) mentioned above but has a disadvantage as it uses extra space..but greedy solution's time complexity can be improved to O(n) by using count or radix sort ..Another point to note is that extra space used in greedy solution is O(1) because of count sort but in second case it is O(n).
- 007mayankpaneri October 09, 2015