CareerCup

  • Questions
  • Forum
  • Resume Tips
  • RSS
  • Sign In

Adobe Interview Question for Developer Program Engineers


Country: India
Interview Type: In-Person
More Questions from This Interview



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

You can find the solution to this problem in the following video lecture it is explained wonderfully there

youtube.com/watch?v=hzEWYlQDA3w

- Anonymous July 03, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

int maxDepth(struct node* node){
    if (node==NULL){
        return 0;
    }   
    else {
        int lDepth = maxDepth(node->left);
        int rDepth = maxDepth(node->right);
        if ( lDepth > rDepth)
            return (lDepth+1);
        else 
            return (rDepth+1);
    }
}

- Anonymous July 03, 2012 | Flag
Comment hidden because of low score. Click to expand.
1
of 1 vote

The time complexity for the above code would be O(n). This would be achieved in the case where a binary tree would have all nodes on its left or all nodes on its right.
The space complexity is Theta(n).

- teli.vaibhav July 03, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

the above solution is correct...

- Anonymous July 03, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Do you people have any non recursive approach?? Its easy to do without recursion in O(n) also.

- BABA July 07, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Since the algorithm is o(n) with theta(n) space in recursive, you could simply do an iterative BFS?

- Tyler July 09, 2012 | Flag Reply


Add a Comment
Name:

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

Books

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

Videos

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