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.
Yeah, I think we probably need do some trick based on binary search. Here is my way:
- JiangchuanHeGlobal June 10, 2014implied tips: the data in the array is sorted.
1. start from the first index value, find the end index(say i) of this value using binary search
2. jump to the index of the second value(say i+1) and repeat the step using binary search
until i reach the end of the array
-------------------
But I'm not very sure if this algorithm runs in O(logN), since I'm not sure if the distinct values of this array is relevant to O(N) or not. Can somebody explain it? Thx