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.
This is how i would solve this :
- Sorrowfull Blinger September 13, 2014Do a level order traversal of the tree iteratively (using Queue).So your end output should given an array of values which represent the sum of nodes at every level. Now inorder to satisfy the problem we use a DP approach and start from the lower to higher levels of tree.
MaxIndependent(i) = At 'ith' level the maximum independent set (i am not sure if maximum means cardinality or the sum of elements of nodes - change accordingly).
MaxIndependent(i) = Max( MaxIndependent(i-1) , SumArray[i] + MaxIndepedent(j) any of the below level j <i )
the base case is for the lowest level