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 this: if we can change the tree, its quite easy I guess. In the first traversal every node.value gets value 1 more than its parent. Second traversal we sum how many times each value occurs:
- 6dot32 February 08, 2013consider tree structure: value, right, left
step 1: traverse(by changing)
step 2 : count occurrences of same level
public static void traverse(node root)
{
if(root ==null)return;
if(root.left!=null) root.left.value = root.value+1;
if(root.right!=null) root.right.value = root.value+1;
traverse(root.right);
traverse(root.left);
}
arraylist<integer> arr = new arraylist<integer>
public void countmax(node root, arraylist<integer> arr)
{
if(root ==null)return;
arr[root.value]++;
countmax(root.left);
countmax(root.right);
}
finally return index of max of arr