Skip to content
Related Articles

Related Articles

Improve Article
Adobe Interview Experience | Set 43 (For MTS Role)
  • Difficulty Level : Medium
  • Last Updated : 10 Jan, 2019

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.
         1
        /  \
      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 contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :