Adobe | MTS 2 | Interview Experience | Noida | Offer
Summary
I interviewed for the MTS 2 role at Adobe in Noida, successfully completing four rounds focused on DSA, C++ fundamentals, system design, and project discussions, ultimately receiving an offer.
Full Experience
Round 1: This round was primarily focused on DSA.
- Trapping Rain Water: https://leetcode.com/problems/trapping-rain-water/
- Given an OBJ_ID(key) which is really long number and cannot be represented in primtive types like long long, int, etc. Implement a data structure which performs get, insert and delete in constant time. Keep in mind that don't use unordered_map since in worst case it can go till O(n).
Note: In second question, I was stuck on the unordered_map approach and after a lot of discussion with the interviewer why it would not work and the possible scnearios. The trie approach hit me and I discussed that with the interviewer and he was satisfied.
There were also very basic questions around C++ fundamentals.
Round 2: At the start of the interview, I was bombarded with a lot of questions around data types, in which part of the memory are static, global variables stored, smart and raw pointers comparison. Some coding questions:
- Given a number n, find the number of trailing zeroes at the end od n factorial.
- Give a working code where using a raw pointer is leading to a memory leak and then using a smart pointer fixes it.
- https://leetcode.com/problems/coin-change/description/
Round 3(Managerial Round): The interview started with the introduction. We had discussions around my project and what was my role in it. Then we jumped onto the coding questions:
- https://leetcode.com/problems/intersection-of-two-linked-lists/ (Immediately gave the approach and interviewer asked not to code it and jumped to next question)
- The scenario is something similar to above and the point is now you have large number of linked lists and they can merge at any point with any linked list. Keep in mind that interviewer was completely against using any extra space, by which I mean is O(n) and time Complexity of O(n) was expected. Return the vector<vector> which merge at some point. (PS: I think this was a tricky question if not seen beforehand, solution would be to store the tail and the correspoding list in an unordered_map. I initially started thinking into a graphical/tree approach. Took me a while to come back and think simple). After this, there was discussion around AI which was something general.
Round 4(Directorial Round): In depth project discussion based on the technicalties and how specific things were handled. Design the Acrobat Desktop file system. I asked some clasrifying questions and scope of the problem. Was able to quickly implement it and it ended fairly early.
Overall it was a good interview experience. The overall process took a week for me.
Overall Verdict: Selected
Interview Questions (9)
Given an OBJ_ID(key) which is really long number and cannot be represented in primitive types like long long, int, etc. Implement a data structure which performs get, insert and delete in constant time. Keep in mind that don't use unordered_map since in worst case it can go till O(n).
Questions around data types, in which part of the memory are static, global variables stored, smart and raw pointers comparison.
Given a number n, find the number of trailing zeroes at the end of n factorial.
Give a working code where using a raw pointer is leading to a memory leak and then using a smart pointer fixes it.
The scenario is something similar to above and the point is now you have large number of linked lists and they can merge at any point with any linked list. Keep in mind that interviewer was completely against using any extra space, by which I mean is O(n) and time Complexity of O(n) was expected. Return the vector<vector> which merge at some point.
Design the Acrobat Desktop file system. I asked some clasrifying questions and scope of the problem. Was able to quickly implement it and it ended fairly early.