Skip to content
Related Articles
Open in App
Not now

Related Articles

Adobe Interview Experience | Set 43 (For MTS Role)

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 10 Jan, 2019
Improve Article
Save Article

Round 1st

  1. Questions about my projects, past experience
  2. Design an Elevator system

Round 2nd

  1. Given two nodes and root of the binary search tree. Find the LCA of the two nodes.
    Solution: GeeksforGeeks Link
  2. Extend the solution to binary tree.
    Solution: GeeksforGeeks Link
    Discussion went for the following corner case.
    When one of the two nodes belong to the subtree of the other and LCA, in that case, is the parent of the node whose subtree the other node belongs to. How would you handle this case.

Round 3rd.

  1. Given a number in decimal. Print it’s binary representation.
    Solution: GeeksforGeeks Link
  2. Given two huge files (can’t fit in memory) having strings, print the common strings in them.

Round 4th

  1. Asked about the projects.
  2. Given a number N, print the triangle of asterisks.
       Ex: N = 4
        * * *
      * * * * *
    * * * * * * * 

    Solution: GeeksforGeeks Link

  3. Question on processes and threads.
  4. Given a binary tree. Print the level order traversal but from the lower side.
        /  \
      3     4
     /  \     \
    6    7     8
    Print 6 7 8 3 4 1. 

    Solution: GeeksforGeeks Link

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!