Kalido Interview Question
Software Engineer / DevelopersCountry: India
Interview Type: In-Person
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.
The solution can be achieved if we traverse the tree like BFS
- SecretAgent October 11, 2011Enqueue root node first into a queue A(first level)
Dequeue the root node in queue A and enqueue it's children in queue B
Now dequeue all elements in queue B and enqueue their children in queue A
Increment a counter whenever you use a queue
do until you don't have any elements in the queue
The above process is like level order traversal and the incremented count gives the levels or height of the tree