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.
sorry dude...but this is O(mn) or generically speaking O(n^2). :( . You can do O(m) assuming n is very very small compared to m ( where n and m are the input array sizes ). Do correct me in case I have misunderstood what you are trying to do in your code.
- seerugr8 June 20, 2014Or you could use some extra memory to put them into data structures like hashsets.
Am curious: wasnt there any condition to this? like you got to be within some decent efficiency limits? or cannot use extra memory??