Open In App

Adobe Interview Experience (For MTS-1)

Last Updated : 10 Jan, 2019
Improve
Improve
Like Article
Like
Save
Share
Report

Round 1: First round was coding round on HackerRank. It had 5 questions based on Regular Expressions and Inheritance.

Round 2: Second Round was technical round ( 45 min – 1 hr ).

  1. Which data structure should be used to implement back and forward feature in the web browser, and how to implement it?
  2. A number N is given. Find the power of 4 which is greater than the number N.
  3. What is Multithreading?
  4. What are mutex and semaphore?

Round 3: Third Round was technical round ( 1:15hr – 1:30 hr )

  1. You have N coins, which can be replaced either by N Rs. or can be exchanged for (N/2)+(N/3)+(N/4) coins. Find the maximum number of Rs. that can be made, using Dynamic Programming.
  2. Implement Snake and Ladder game and find the minimum number of moves required to reach from 1 to 100 in a given game, using Dynamic Programming.

Round 4: Fourth Round was technical round ( 1hr – 1:15 hr )

  1. Replace every occurrence of “is” by “are” in a given string, using minimum write operations.
    Eg. This is my pen.    Output: Thare are my pen.
  2. Discuss logic and write code for the following problem.
    You are given two words and a number N. Find the two words in a limit of N words and if found print the indexes of two words.

    Eg. Word 1: is    Word 2: pen   N: 3     String: This is my pen.   Output: 2 and 4.
    In the limit of N words, Word 1 and Word 2 can occur in any order.
    Eg. Word 1: pen    Word 2: is   N: 3     String: This is my pen.   Output: 4 and 2.
  3. Write a program to find all the probable elements that can be inserted in any given box in a Sudoku game.
  4. New features introduced in latest Java Version.
  5. Questions from Collections in Java.

Round 5: Director Round ( 1:15hr – 1:30 hr)

  1. Design lift, following the constraints that should be followed by the lift.
  2. Discussion on my projects and paper published.

After these rounds, I had one round of general interaction with the Manager.

 


Previous Article
Next Article

Similar Reads

Adobe Interview Experience for MTS-1 (1.5 Years Experience)
2 Rounds of online test, one related to aptitude and other is related to c++. Aptitude one had around 39 questions and 2hours was given. C++ one had 19 questions and 2 hours was given. 7 coding questions and others basic c++ questions. Round 1(Technical):- There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. o
3 min read
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 for MTS-2
Round 1 : online test (75mins) 15 apti LR questions 5 c++ questions 2 coding questios Given list of names and votes... output the winner with maximum votes( I used hashmap). Consider a string, s = "abc". An alphabetically-ordered sequence of substrings of s would be {"a", "ab", "abc", "b", "bc", "c"}. If we reduce this sequence to only those substr
3 min read
Adobe Interview Experience | MTS-1
1. Online Assessment Test (HackerRank) a. 15 aptitude questions (15 mins) b. 5 input-output programs (15 mins) c. 2 programming questions (45 mins) 2. On-site Round 1 - Technical Round (1 Hour) a. Discussion on projects, their architecture diagrams, etc. b. Sort an array containing 0s and 1s in single pass, O(n) time and O(1) space complexity. c. A
5 min read
Adobe Interview Experience for MTS - II (August 2019)
Round 1: Technical(F2F - about 45 minutes) Detect whether the given linked list is Y-shaped. - [ https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/ ] Clone a linked list with random pointer. [ https://www.geeksforgeeks.org/a-linked-list-with-next-and-arbit-pointer/ ]. Note - Go through each method beca
3 min read
Adobe Interview Experience for MTS
Got shortlisted on the basis of cocubes score. After being shorlisted there was a online coding round of half an hour which consisited of two questions. First question was easy and second was boolean matrix.. https://www.geeksforgeeks.org/a-boolean-matrix-question/ Candidates shortlisted were called for interview in their office. Round 1: First, he
2 min read
Adobe Interview Experience for MTS-1
Round 1: Interviewer asked me to choose one of the topics from programming, DS and algorithms. This was a C++ specific drive so I chose programming. He asked me to write a program where an array is given and we need to print the elements of array in such a order that we get the highest number. Eg - input (23, 234, 3, 231, 56) output- 56323423231 I
3 min read
Adobe Interview Experience for MTS-2
Round 1: Technical Interview Round 1 First-round was with a Senior Computer Scientist who started with C++ fundamentals: Copy ConstructorMove ConstructorShared pointersVirtual Fn, Vtable, VptrVirtual constructor and destructor and more into same.After that basic data structures and how they work internally.Some DS questions: Like find the loop in L
2 min read
Adobe Interview Experience for MTS-1 (1 Year Experienced)
Requested for a referral in Jan 2021 from a senior, got an interview call in April. 4 rounds in total. (2 on same day and next 2 in proceeding 2 days) Round 1(Level- Easy): Two ds questions were asked:- https://www.geeksforgeeks.org/connect-nodes-at-same-level/Coin change dp I became pretty overconfident In second question as round was too easy, an
3 min read