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.
Sorting of the initial array endup with O(nlogn) complexity. However, this problem might be resolved with O(n).
Let assume that the finest time is a second. Then array of seconds in a day will handle if and order was processed that time.
During the scan of the order list this array will be filled with info.
Second path on the "seconds" array the longest time will be calculated.
This code also is very easy to parallel, no syncronization is required.
The code:
- ee.fiksman December 14, 2013