Open In App

Adobe Interview Experience | Set 32 (For MTS-1)

Last Updated : 19 Jan, 2016
Like Article

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 questions:

1. To check if the parenthesis are balanced.

2. Matrix has rows in the form of 1’s followed by 0’s. Find the row with maximum number of 1’s.

3. Reverse a linked list.

4. Multiply two numbers using minimum number of additions.

5. Find if the number if palindrome or not?

6. Find the number of pairs which sum up to a particular sum ‘K’. Numbers may be positive or negative

7. Every number ending with 3, has at least one multiple of all 1’s.

2) Telephonic round

Q1: Find the smallest K elements in a continuous stream of integers.

Q2: Find the intersection point of two linked lists.

Follow up – You can’t compare node’s data as well as address.

Q3: Write code for merge sort.

3) F2F

Q1: WAP to clone a linked list.

Be sure to cover all the edge cases.

Q2: There are n players in a tournament. Players hold transitive property i.e. if A beats B and B beats C then A automatically beats C. Find the minimum number of matches required for finding the winner.

Follow up – Minimum matches for finding the first runner up. Which data structure will you use for this question?

Q3: In memory layout of a process.

4) F2F

Q1: You developed your own image editor let’s say Picedit. An update of Picedit is delivered to customers. After updating, the customers report an inconsistent problem of Picedit crashing but the same cannot be reproduced at your end even by using the same image file.

You are provided the window crash call stack by customer. How will you approach this problem? What are the probable causes?

How will you use call stack to find out the erroneous line of code?

A lot of discussion on reasons for heap corruption.

Q2: Design a garbage collector in c.

Q3: Suppose you have a repository of a million records of mobile numbers. A lot of discussion on how will you store these numbers so that you can check whether a given number already exists in minimum space and time complexity?

Q4: Discussion on stack frames, Printf, signed int and unsigned int memory representation.

5) F2F

Q1: Find output of a program related to pointers. (It was simple although I got it wrong first 😛 )

Q2: You are given a function let’s say bin() which will generate 0 or 1 with equal probability. Now you are given a range of contiguous integers say [a,b] (a and b inclusive).

Write a function say rand() using bin() to generate numbers within range [a,b] with equal probability.

Q3: Consider a regular telephone dial up. It has generally three alphabets for each digit. For example, ABC for 2 and so on.

Given a number. Print all the possible strings by taking one alphabet corresponding to each digit in number.

Input: 254

Output: AKH, AJG etc.

Q4: WAP to tokenize a string.

6) F2F

Q1: Given a number say N. WAP to print the next greater number by using the same set of digits of N. For example:

Input: 123

Output: 132

Q2: You have a continuous stream of strings. At any point of time, you have to print the strings such that those which are permutations of one another are printed together.

WAP for the same.

For example:

Input: {‘act’,’cat’,dog’,’tac’,’abc’,’god’,’bac’}

Output: {‘act’,’cat’ ,’tac’,dog’,’god’,’abc’,’bac’}

7) Director round

Q1: Discussion on a piece of work that you have done in your past and you are proud of.

Q2: Design a mobile application that gives user a set of nearest restaurants available.

Discussion on what will be your approach for densely populated areas and sparsely populated areas.

How will you identify whether user is in densely populated area or sparsely populated area.

You have (x,y) coordinates of user as well as all the restaurants with you.

8) HR round

Q1: What do you know about Adobe? Its headquarters etc.

Q2: Why Adobe?

Q3: Why should we hire you?

Q4: PDF full form.

Few Tips:

  1. Adobe truly evaluates a candidate on the basis of how you approach a problem instead of bookish answers. You can get through even if your answer is not the best one but approach is different. Concentrate on that.
  2. Be prepared with space and time complexities for all the questions.
  3. The programs that you will write should handle all the possible test cases.
  4. You will be asked for more than one approach for almost every question.
  5. Interviewers were very friendly and will make you feel comfortable.



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 28 (For MTS-2)
Written round: 3 hours of written test. First technical and then aptitude. Few technical questions that I can remember. int* a = (int*)60; int* b = (int*)40; printf("%d", a-b); Print the output. (Ans: 5) Given a boolean number in string form. WAP to output the 2's complement of the number in the same form(string). Convert a prefix expression to pos
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 :