Adobe Full-stack MTS-2 Bangalore India Interview experience
Question Details
Applied through referral
**
Round 1 DSA + LLD** Asked to design and code a file system. There were two types of queries: 1. Add a file path (string) to the system if it doesn’t already exist. 2. C
Full Details
Applied through referral
**
Round 1 DSA + LLD** Asked to design and code a file system. There were two types of queries: 1. Add a file path (string) to the system if it doesn’t already exist. 2. Check if a given file path exists in the system. Implemented it using a Trie data structure in C++ for efficient operations.
**
Round 2 LLD + DSA + Front-End** Asked to design and code a Rate Limiter, which I implemented using a queue in Java. Then I was asked to design and implement a vending machine. I was able to explain the approach but couldn’t complete the full implementation. At the end, I was asked about React’s useMemo hook and how to apply it in that scenario, which I explained clearly.
**
Round 3 DSA** Asked a medium-hard dynamic programming problem (LeetCode level). Solved it quickly, and the interview ended soon after.
**
Round 4 Hiring Manager Round** Asked to implement the Singleton design pattern in a multithreaded environment. With some hints from the interviewer, I completed it successfully. Then, discussed the LFU cache design. I initially suggested an O(n log n) approach, but after some hints, we discussed how it could be optimized to O(n) and which data structures would be best suited.
Result:
Rejected. The recruiter informed me after 45 days that hiring for the position was put on hold.
About This Question
This is a reported interview question from a adobe interview for a frontend role during the phone screen round reported in 2025.
It covers the following topics: Binary Tree, Dynamic Programming, Oop, Queue, Stack, Strings, Trie .
Difficulty rating: Hard