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.
After viewing the wiki page "Maximum subarray problem", I find out this problem can be solved by "Kadane's algorithm".
Note: before DP, we have to traverse the int array in case all elements are negative.
This algorithm runs at O(n).
Below is my implementation which has a minor difference from the original algo on that mine also return the star and end indices of this max sub sequence.
}
- offerduo June 16, 2012