Hi there,
I recently interviewed for Adobe MTS-2 role.
Shortlisting Criteria - Got a call from the recruiter after receiving a referral from the friend in the same team.
Round - 1 | DSA
Two questions in this round
Q1. Given an array of integers, you can perform the following sequence of opeartion
- Fetch an element from the array
- Divide it by 2 (ceil division)
- Put the element back into the array
The above operation(considerd as one) can only be performed K times. You need to minimize the sum of all the elements which are finally in the array after K operations.
Solution: LC easy question -> Solved with PriorityQueue
Time Complexity O(NLog(N)) | Space Complexity O(N)
Q2. Knapsack Problem Slight Variation
Solution: LC easy question -> Solved with 2d DP and slight optimizations.
Time Complexity O(N) | Space Complexity O(1)
Round - 2 | LLD
One question in this round
Q. Design a configuration management service. Share the class designs, attributes, methods, design patterns etc.
Round - 3 | LLD
Two questions in this round
Q1. Design an auto-complete search system with Top K elements as prediction. The Top-K should be based on frequency of search.
Solution -> LC hard question -> Trie with Variation
Q2. Design the Linux commands for creation, navigation, deleting directory for files in java (mkdir, ls, delete, etc.)
Solution -> Used a Tree Data Structure to solve the problem but could only complete one function in time.
Verdict - Rejected