Adobe came in our college for MTS (Member of Technical Staff profile).
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 cupcakes.At the end of the journey you should have Z cupcakes.Input is three numbers X, Y, Z.You need to output the maximum number of cupcakes that one can have in the journey.
- It was maximum contiguous sum sub-array problem.But it was not directly stated.A story was formed around it.If you observe the question correctly you will get that it maps to the maximum contiguous sum sub-array problem.
- You are given two strings S1 and S2. S2 contains a ‘*’ in middle not at start or end.Now the ‘*’ can be replaced by a NULL character or any other substring from s1.You need to return the number of strings from s2 that are substrigs of s1. Ex-
Ans – 12(Count every occurrence of “aa” matching with a following “b” and sum them all you will get 12)
Results were out after 3 days or so.20 students were selected after this round.My first question ran partial and second full.Last I attempted using find() and substr() but due to a stupid mistake, it didn’t pass.But I got shortlisted though they were also students whose q1 and q2 ran fully. Lucky me ;)!
Round 2 started with him asking me “Tell me about yourself”.He didn’t even took my resume.Then he asked me about what all projects I had done.So he took one of my project related to Naive text classification.And asked what if the search bar you have created need to have suggestions coming up once the user enters a word. Like if my db has “data Analysis” and “data mining” and “data classification”, if user types in data, he should get Analysis, mining and classification as suggestion.I gave a Trie based approach.Wrote the class for Trie. Explained the node structure, working and all. Next he asked what if your text is huge and you have lack if storage how would you store.I told him sir like we do in our computers we zip it, similarly we will encrypt our data and when needed we ll decrypt it.He asked how? I suggested Huffman Coding and explained it.Next he asked SQL, I said sir not one of my strong points.So he moved on to next.Then he asked about dynamic memory allocation, where it’s done and all, some thread related questions.Like multiple threads are running and some are not even used but user forgets de-allocate them? what to do? I said we will deallocate them gave a timestamp based approach where current time could be compared with timestamp of the thread to decide on deallocating it.He asked about problem of finding mutual friends in a facebook kind of network. what ds to use? I said graph based and would do bfs traversal and take a boolean marker to mark the friend as mutual.Also marking visited notes.
In second round, 7 students were rejected.
Round two started with my project.It was much deep into how you did it, tell your complete implementation process frontend, backend etc.The machine learning project was again up for discussion.Sir asked about how will you handle access to the disk when data is so large.I provided a cache based approach.Further discussion went around how will you decide what to store or remove from cache.He asked about designing a game- chess firstly but I don’t play chess which I told him.So then it was discussion on designing Snakes and ladder game.He asked about what problems will you face at every level – front end, persistent memory and in rendering if data is huge and how will you solve them.I answered as huge results may be shown through pagination.Ranking of the results based on relevance metrics(popularity of the result) can also be done.For the backend I suggested if single node can’t handle computation, we can distribute it to multiple nodes.Suggested Master- Slave Architecture.He asked what if the master fails.I said chose the best slave to be the master.Discussion went on how you ll chose it what will you do for time when there’s no master.Back-up data could be used.This round was very different as they were not asking direct question but instead checking your approach in solving a problem and once you will give one, they will add one more problem to it to make it more complex and see how you handle that again.
3 students were selected for this round.It started with Sir asking about using Naive bayes for text classification.So he asked about Naive bayes theorem, conditional probabilities.If say Indian parents keep on having a child till they get a son, what is the ratio of probability girls to boys.Interrupting him in between I said, Sir poor Indian mentality.To which he laughed and said that would be a long discussion so let’ not go that side.If not naive bayes classification what other algorithm you would use and why?Then he asked my Fav subjects.I said OOPS, OS, DS. Then He asked if two C++ programs are running should they be allowed to access a common txt file.I answered if both reading ok, if one is trying to write then we need a synchronization tool.I gave him mutex based approach.He then asked about stack data structure what is the use if it? real life examples.For queues provide the same.I gave processing of requests in server side, data communication serial wise.Then moved on to binary tree.Real world example, I said Decision tree Algorithms.Then he asked about priority queues and their implementation.He then asked about designing a BMS kind of system.Then he asked reversing a linked list question code it.Iterative, recursive both.In recursive he was most interested.He asked about how you would optimize it and save your loop.Then he asked about adding two numbers without using add operator. I gave a bit level approach.Then he asked given a linked List, Remove the last K nodes and return the reverse of remaining. Optimized approach expected.Ended with you have any questions for me…
2 people were selected for this round.HR started with you have any questions for me.He explained about the new campus graduates program.Then most frequent one “Why us? Why Adobe ?”, He asked certain situation based questions like what if 1 year down the line a company offers you double the package, would you/not leave adobe? explain reasons.Why do you think girls are under- represented in coding sphere?Asking about my opinion on that.The discussion went towards feminism and all.He then asked about Noida or Bangalore option.My heart was pounding so hard by this time.Results were announced soon.
2 were selected and I was one of them, So happy that Adobe happened.Tip- They test your basics very well so keep that strong, be relaxed in the interview if you are stuck, they will throw in hints, so listen to them carefully. Thank you geeksforgeeks!Your platform is doing a great job in helping out students.So big thank you!
- Adobe Interview Experience | Set 56 (Off-Campus Full Time for MTS profile)
- Adobe Interview Experience | Set 18 (For WBT Profile)
- Adobe Interview | Set 14 (On Campus for Full Time)
- Microsoft Interview Experience (Full Time 2018 Washington DC - with 2.5 years of experience)
- GwynnieBee Interview Experience (Full Time)
- Gwynnie Bee Interview Experience (Full Time)
- DE Shaw Interview Experience | Set 23 (Full Time)
- HP R&D Interview Experience (On-Campus, full time)
- Microsoft IDC Interview Experience (For Full Time)
- Amazon Interview Experience | 399 (On Campus for full time)
- Microsoft IDC Interview Experience | Set 150 (Off-Campus for Full Time)
- Microsoft IDC Interview Experience | Set 156 (Off-Campus for Full Time)
- Amazon Interview Experience | Set 377 (On-campus for Full time)
- Saggezza Interview Experience (On Campus Full Time)
- Tesco interview Experience for full time (on campus)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.