jk
Comments (1)
Reputation 0
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.
Looks like I miss something here... I see answers and they looks good. but did not get how the conditions are met in the logic.
- jk April 23, 2017what we need to do : Select the numbers in order to have the maximum sum from collection.
Limitations.
1) sequentially placed boxes
2) Cannot select adjacent box to it, but can select any other.
So once I select a box i cannot select next one. so essentially I can skip one box but if a select a box i cannot select next box to it.
How these conditions are met.
10, 0, 0, 0, 20 -> 0, 0, 0, 10, 20 = 30? but it fails the rule since if i select 10 i cannot take 20.
8, 1, -1, 2, 20, 10 - > -1, 1, 2, 8, 10, 20 = 28. Yes i get the answer. but how it is coming in?
-1, -2, -3 = is this should be -1 and not zero since the maximum value must be the sum of one or more values from array?