Open In App

Adobe Interview Experience | Set 28 (For MTS-2)

Last Updated : 23 May, 2019
Like Article
  • Written round:
    3 hours of written test.
    First technical and then aptitude.

    Few technical questions that I can remember.

    1.  int* a = (int*)60;
       int* b = (int*)40;
       printf("%d", a-b);
       Print the output. (Ans: 5) 
    2. Given a boolean number in string form. WAP to output the 2’s complement of the number in the same form(string).
    3. Convert a prefix expression to postfix.
    4. Some assembly program was given, needed to tell what exactly the program was doing.
    5. Some basic hash related questions.

    Aptitude questions are standard and repeated every time.
    Can be looked up on the net.

  • Round1: F2F
    1. Implement n-ary tree using down-right approach.
      Traversal both level-order and in-order.
      Asked to code eveything.

    2. What data structure would you use to store a composite linked list?
      Composite means that the data value in the individual nodes could vary among the primitive data types.

      I started with void* and an enum entry to specify the type to help during retrieval.
      Then moved to using union. He looked happy with this.

    3. Implement malloc and free.
    4. Memory layout of a C program.
    5. What do I like about Adobe Photoshop from the technical point of view?
      How would you load and display a 3 GB data file at runtime.
  • Round 2: F2F
    1. Design and implement garbage collector in C.
      Many aspects were discussed here.
      When to trigger?
      Who is responsible?
      Which memory to free?

    2. Given an integer number, how would you determine if it is a palindrome.
      He wasn’t too impressed with the stack based method.
      Wanted in lesser space complexity.

      So gave solution like this:
      rem = num1%10;
      num1 = num1/10;
      num2 = num2*10 + rem;

      if the new number created in equal to the original, it is a palindrome.
      He wanted me to optimize it further.

      So started comparing num1 and num2 also, if the number has even-digits, it would return early.
      Also, if the number is a multiple of 10, can outrightly say it is not a palindrome.

    3. Given an integer number, find the next higher palindrome number.
  • Round 3: F2F
    1. Code to check if a binary tree follows the below property.
      Every node’s data = sum of left subtree + sum of right subtree.

    2. Design a model for implementing sync mechanism for Google drive.
      (handling only the client side).
      The same file can be accessed and modified by different clients.
      Take care of power failure, no internet connection scenarios too.

    3. Given an infinite stream of boolean digits, need to tell at runtime whether the number received so far is a multiple of 3.

      Example, first digit received is 1, so the number is 1 -> not a multiple of 3.
      the second digit received is 0, so the number is 2 -> not a multiple of 3.

      The constraint is that you can only use a 2-bit buffer to store.

      Ans: always store the remainder to know if it is a multiple of 3.
      in the above example,
      rem = 1%3 = 1
      when 0 comes, new remained = 2*1 + 0 = 2 %3 = 2.

      and so on.

  • Round 4:
    1. Code for given a sorted but pivoted array, find the ceiling of a given number.
    2. Discussion on projects.
      Volatile keyword.
      Discussion on the use of extern and static.

    3. Big endian and little endian architecture.
      How to identify if big endian or little endian.

    If something has been written on the disk using big-endian architecture and then read using little-endian architecture, how would happen?

  • Round 5:
    2 questions asked here, I genuinely didn’t know the answer to.
    I just tried attempting in all possible ways and analysing the pros and cons.

    1. Given a rectangular sheet of paper and a set of very irregular shapes.
      I was to cut these shapes out of the paper, in such a way
      that ‘there is a good mix’ of all the pieces and the wastage of paper is minimal.
      When I say irregular, it can also have a hole in the middle.

    2. Say now, on a touchscreen display, you have those set of irregular pieces.
      You touch at a point and swipe it, the corresponding piece should move in that direction. This game is interactive and needs good time complexity.

    3. Given a fairly large number, need to tell whether the number is part of Fibonacci series or not.
      You are not allowed to generate all the number in the Fibonacci series.

      I was not aware of the direct formula to check this at that point.
      So tried the matrix multiplication method to calculate the nth Fibonacci number.
      I calculated the 1st number, 2nd number, 4th and so on, till the number exceeded the given number.
      And then used a binary search to track the answer down.

    4. Was asked if I could improve the performance on the hardware.
      I said by calculating all fours member of the matrix parallelly on four cores, if available. He looked satisfied.

Asked to explain the MVC Design Pattern.

Thank you GeeksforGeeks for the awesome resource you are!

Previous Article
Next Article

Similar Reads

Adobe Interview Experience | Set 55 (On-Campus Full Time for MTS profile)
Adobe came in our college for MTS (Member of Technical Staff profile). Round 1: This was an online round conducted on Hackerrank platform.It had 3 coding questions.:- You need to buy cupcakes as you visit from one shop to another.You can either buy a cupcake, sell a cupcake or do nothing.You will be visiting Y shops.And initially you have X cupcake
7 min read
Adobe Interview Experience | Set 56 (Off-Campus Full Time for MTS profile)
Round 1: Online Hackerrank Test Round 2: Technical Round Asked about past project & challenges faced. Opening an application as multiple processes but use them such as if one application is opened, another instance, process of same application cannot be opened till previous is closed. Solve with Semaphore. Puzzle : 100 balls are there, 50 are r
1 min read
Adobe Interview Experience | Set 19 (For MTS)
Written round: Same test every-time. 1st round: He asked me to write code for hello world in C. Then he asked where this printf is stored and how compiler knows where to check that thing. If printf declaration is moved to the program will it get executed. I told him that I am not aware of these things. Connect Nodes at Same Level without using extr
3 min read
Adobe Interview Experience | Set 24 (On-Campus for MTS)
Adobe came for recruitment in my college. Here is my experience- First round was an online round- There were some aptitude questions and 3 coding questions. I remember only 1 ques out of the three. You are given the height of n towers and value k. You have to either increase or decrease the height of every tower by k. You need to minimize the diffe
3 min read
Adobe Interview Experience | Set 25 (On-Campus for MTS-1)
Initial Round: Aptitude Paper: 45 questions to solve in 50mins. The platform was Hackerrank. No negative marking. I solved around 35 approx. correctly. Online Coding: 3 questions to solve in 90mins. The platform was Hackerrank. Two of them I remember. Given a string with no spaces and random characters, we have to find that a given word can be form
6 min read
Adobe Interview Experience | Set 26 (On-Campus for MTS-1)
Adobe visited our campus for full-time Member of Technical Staff-I (MTS-1) First round consisted of an aptitude test and a coding test. The aptitude test had 45 minutes and 45 questions. The test was an average one. A tip starts the test from the last question they were really easy as compared to the starting 15 questions. The coding test had 3 que
3 min read
Adobe Interview Experience | Set 32 (For MTS-1)
I was recently interviewed for MTS-1 at Adobe. Here is my interview experience: 1) Online written round 1. Aptitude test, time = 45 min, questions = 60. (Tip: Start from last question.) 2. Coding test, time = 2hrs, questions = 7 coding, 13 technical multiple choice. Multiple choice questions contained maximum questions related pointers. 7 coding qu
5 min read
Adobe Interview Experience | Set 34 (For MTS-1)
Recently I appeared in interview for MTS-1 Adobe. Here is my experience. Written Round: Very easy aptitude Questions on geometry, DI, profit loss etc. Main are the coding questions which were: 1. Paranthesis matching 2. Row with maximum 0s in a matrix with 0s and 1s where in each row 0s come before 1s 3. Multiply two numbers without using * operato
4 min read
Adobe Interview Experience | Set 40 (On-Campus for MTS-1)
Online test: Coding : Time : 90 minutes There were three coding questions as follows: A man starts from his house with a few pan cakes. let they be N. Now he visits K places before reaching home. At each place he can buy a cake, sell a cake or do nothing. But he must sell L cakes before reaching home.Find the maximum number of cakes he can have at
5 min read
Adobe Interview Experience | Set 43 (For MTS Role)
Round 1st Questions about my projects, past experience Design an Elevator system Round 2nd Given two nodes and root of the binary search tree. Find the LCA of the two nodes. Solution: GeeksforGeeks Link Extend the solution to binary tree. Solution: GeeksforGeeks Link Discussion went for the following corner case. When one of the two nodes belong to
2 min read
Practice Tags :