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

Last Updated : 12 Aug, 2024

Online Written Test on HackerRank – 75 mins (15 Apti, 5 C++ ,2 Coding)
Round 1

WAP to Check if there is an intersecting node in 2 linked lists
What is .dll ?how it is loaded? Why dynamic linking not static linking
Difference between semaphore and mutex?
Why is cache needed? What happens when we watch the video? Who allocates memory to process?
Virtual functions,
function overloading
Write a macro for swapping two variables
WAP for chocolate and wrapper puzzle
https://www.geeksforgeeks.org/program-chocolate-wrapper-puzzle

Why is Virtual destructor needed?Can there be a static virtual function?
Difference between typedef and macro?
Internal implementation of priority queue.

Round 2

How to find k frequent words in a file
WAP to Delete a string in trie, various use cases?
WAP to Find lca of a tree?
Wap to Make the largest number out of array elements given.
Design book my show.

Round 3 (managerial)

Find a loop in linked list, only approach
Sort an array larger than RAM
WAP Merge Sort
WAP BFS based question(don’t remember)
Diff. between TCP and UDP
How lan works
How socket works
Diff. between process and threads

Round 4 (director)

Why didn’t sit for Adobe in college placements?
How the earlier interviews went?
What have you learned in these 3 yrs professionally?
Why you left the job? What was the hurry?
What are your aspirations?
Explain your college project.
What kind of work should be given?
Any particular preference for any language
What is Dynamic programming? Examples where DP is used?
Given a length l , find the angle or dimensions of the 4 sided quad. formed having max area, this quad is not a square.

Round 5 (managerial)

Brief Introduction
Asked to explain 1 company project. What would you do differently?
Difference between monolithic and microservices. How to convert monolithic architecture into microservice
Program to Rearrange characters such that no two characters are same

https://www.geeksforgeeks.org/rearrange-characters-string-no-two-adjacent/

All Practice Problems for Adobe !

Anonymous

News

Improve

Previous Article

Amazon interview Experience | Set 133

Represent a number as sum of minimum possible pseudobinary numbers

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

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

Adobe Interview Experience | Set 51 (For MTS Fresher)

Online Aptitude Round Online Aptitude Round consisted of 60 questions. I did about 40 questions with 90% accuracy. Online Coding Round Online Coding Round consisted of 2 questions related to arrays and strings (very easy). One question was related to total number of palindromic strings. For both questions, coding platform was CoCubes. Those who did

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

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

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

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

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

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

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

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

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

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

First round was online for 75 minutes on hackerrank. 3 sections: Aptitude,Output and 2 coding questions. Coding questions: Given a string find alphabetically first and last substrings which start with vowel and end with constant. Solution: GeeksforGeeks Link Given a set of votes.Find the candidate with maximum number of votes. There were 3 F2F roun

Adobe Interview Experience | Set 52 (On-campus for MTS-1)

The complete process for Adobe – Member of Technical Staff consisted of 6 rounds. 1. Online Round 2. Round 1 (Tech Round) 3. Round 2 (Tech Round) 4. Round 3 (Tech Round) 5. Round 4 (HR round) 6. Round 5 (Rapid Fire Round) Online Round (50 + 90 mins) 2 Separate online rounds were hosted on Hackerrank . Online Aptitude Round Online Aptitude Round con

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

Adobe Interview | Set 6 (On-campus for MTS-1)

I would like to thank the entire Geeksforgeeks team, whose contribution has helped me a lot in my preparation for the interviews and getting placed at Adobe. No of rounds: 1 apti + 1 written + 4 PI Aptitude Round: 1 hr 15 questions on Analytical Ability, 30 questions on Data Interpretation and Quantitative Ability Written Round: 2 hrs 10 questions

Adobe Interview | Set 7 (On-campus for MTS-1)

First of all, I would like to sincerely thank the entire GeeksforGeeks team for creating and maintaining such an awesome site. GeeksforGeeks has tremendously helped me in my preparation for the on-campus interviews and finally cracking the job interview for Adobe. Type of Interview: On-Campus for MTS 1 No of rounds: 1 apti + 1 written + 4 PI Aptitu

Adobe Interview | Set 12 (On Campus for MTS-1)

Online Technical Round (2 hrs) 7 coding problems were given along with 13 MCQs. Coding Problems were very easy. Online Aptitude Round(50 minutes) 45 questions were there. Time was the only limit in this round. Two LR passages, 1 DI problem and rest were quant questions. 16 were selected after the online rounds. Round 1 PI This round was all about c

Adobe Interview | Set 15 (For MTS-1)

Recently I got the opportunity to be interviewed for the position of MTS-1 at Adobe. Here is my Interview Experience: Written Round: Part A (50 mins): 45 questions based on logical reasoning, DI, quant and geometry. The questions were easy but the real issue was time in this round. Part B(2 hrs): 13 MCQs on C, C++ basics (referencing and dereferenc

Adobe Interview | Set 16 (For MTS-1)

Recently I got the opportunity to be interviewed for the position of MTS-1 at Adobe. Here is my Interview Experience: Written Round: Part A (50 mins): 45 questions based on logical reasoning, DI, quant and geometry. The questions were easy but the real issue was time in this round. Part B(2 hrs): 13 MCQs on C,C++ basics (referencing and de-referenc

Adobe Interview | Set 17 (For MTS-1)

Written Round There were two round technical and aptitude Aptitude round consisted of 45 questions (50 minutes) except two passage based on logical reasoning rest were easy, time management was important in this round. 20 Technical questions 13 multiple choice from OS and C++, 7 questions were coding related running code were required. After almost

Adobe Interview Experience (For MTS-1)

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 ). Which data structure should be used to implement back and forward feature in the web browser, and how to implement it? A number N is given. Find the power of 4 which is gr

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

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

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

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

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

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

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

Adobe Interview Experience for MTS-1 (Off-Campus)2022

Technical Interview Round 1: The interviewer did not introduce himself and directly asked me for my introduction (it took around 2-3 mins). Then he asked me a DSA problem (he put a problem statement and one test case on the meeting chat window) - https://www.geeksforgeeks.org/given-sorted-dictionary-find-precedence-characters/I asked a couple of qu

Article Tags :

Practice Tags :