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.
My first post. It seems recursive works here. I define a func max_sum to compute the max sum beginning from index n. the func returns two max values, one for starting at first array, the other for starting at second. I print out the optimal sequence in reverse order at the first column of the output, and the sum at the second column. The last row gives the total optimal sum.
p.s. I saw others use two indices i and j for two arrays, while I use one. Can anyone show me the difference? Thanks.
- Wei June 30, 2014