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.
Use a regular BST search but send parent value to children and keep a class level HashMap of current dups
- asrivastava274 November 01, 2012{
HashMap<BSTNode, Integer> dupMap = HashMap<BSTNode, Integer>();
//head will trying to compare with null
void findDups(BSTNode parent, BSTNode current)
{
if(current.data == parent.data)
{
//see if already in map, if not put it in with value 1, else pull out value, increment, insert again
}
parent = current
for(BSTNode child : current.getChildren)
{
findDup(child, parent)
}
}
}
Not the best pseudo code but you get the point