Directi Interview Question for Software Developers

Country: India

Comment hidden because of low score. Click to expand.
of 1 vote

Let us consider left move as "0" and right move as "1" . As "n" is our target node then path from root to "n" will be binary representation of "n-1" represented in length "h".
let binary representation of "n-1" be string "destination".
- While traversing from top to bottom if current command is equal to direction where we
want to procced then it is fine else we will have to visit all the nodes of other subtree.
There are pow(2,h) nodes in a subtree of height h.
will only come out of this subtree if we visit all the nodes of this subtree.

int nextCommand(0),ans(0),currentHeight(h-1);
	for(int i(0) ;i<destination.length();i++){
		if(destination[i] != nextCommand){
			ans += pow(2,currentHeight);
		nextCommand = 1 - nextCommand;

- SSwarnkar13 September 05, 2017 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


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.

Learn More

Resume Review

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.

Learn More

Mock Interviews

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.

Learn More