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.
To yy:
- fuzhijun2009 February 16, 2011Your approach is the same as mine:) Basically we start with the bottom-right point and walk towards the top-left. The first step gives the largest number a[n][n]; the second step gives the next two: a[n-1][n] and a[n][n-1] (don't know which is larger); then the third step would give the next three... Note that for any steps > n, the numbers it give would decrease instead, e.g. step n+1 gives n-1 numbers...
We can do a binary search (a speedup) to determine which step say x we would end up doing to locate the k-th largest element, this has O(logn) complexity. Then do a compare between all the numbers in the step x, at most n elements, and pick up the appropriate one, this at most takes O(n). So the total complexity would be O(n).