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.
How about dynamic programming?
- AaronWang.ISO July 03, 2012first of all, concatenate the array by itself to simulate the circle
for each node i, maintain two maximum: the max sum of consecutive nos between [0,i] and the max sum of consecutive nos ended at i.
then for the last node, its max sum will be either one of them
note the constraint that the sequence length must be smaller than n
to identify the consecutive nos, just maintain the index of the consecutive nos at each node
it seems to be an O(n) algorithm but still a little complicated.