Adobe | Interview Experience | MTS2 | 2022 | Noida
Summary
I interviewed for the MTS 2 role at Adobe in Noida, undergoing five rounds that covered DSA, System Design, and OS questions. Unfortunately, I was rejected due to challenges with the OS questions and a critical mistake in the Lowest Common Ancestor problem.
Full Experience
I had an interview experience at Adobe for the MTS 2 position, holding 1 year and 8 months of experience. The interview process consisted of five rounds, covering various aspects of technical knowledge.
Round 1
This round focused on LeetCode Medium problems. I was given two specific problems: one was the Longest Substring Without Repeating Characters, and the other was Get the Maximum Score. There were also some standard C++ questions.
Round 2
In this round, the interviewer presented a problem involving a running stream of integers. The task was to fetch the rank of an integer, where rank means the count of elements less than the current element. The discussion heavily focused on the choice of data structure and the time complexity implications. I was asked to write the code from scratch.
Round 3
This round involved a system design question: I had to design a movie booking system, specifically outlining the classes I would use and their interactions. Following this, I was asked to solve a problem: given a file, print the last 'n' lines from it. There were also some questions on memory management.
Round 4
The fourth round again involved coding problems. I was asked to solve the Longest Palindromic Substring problem and the Buy Sell Stocks III problem.
Round 5
The final round started with questions on Operating Systems and the time complexity of various sorting algorithms. I then had to solve a problem where, given an array, I needed to find triplets that sum to a given target without sorting the array. The last coding question was about finding the Lowest Common Ancestor (LCA) of a Binary Search Tree (BST).
Ultimately, I was rejected. I struggled to answer the OS questions sufficiently in the last round, and made a stupid mistake by writing the code for the LCA of a general binary tree instead of specifically for a BST. Despite the outcome, the interviewers were very friendly and helpful throughout the process.
Interview Questions (9)
You are given two sorted arrays of distinct integers nums1 and nums2. A valid path is defined as follows: Choose a path that starts at an element in either nums1 or nums2, traverses only along elements present in the same array, and can switch arrays only at a common element. The score is the sum of all unique elements in the chosen path. Return the maximum score you can obtain. Since the answer can be very large, return it modulo 10^9 + 7.
Given a running stream of integers, I was asked to implement a data structure that efficiently fetches the rank of any integer. The rank of an integer is defined as the count of elements less than or equal to the current element in the stream observed so far. The interviewer focused on the choice of data structure and time complexity.
I was asked to design a movie booking system. The focus was specifically on identifying the core classes that would be involved and describing their interactions, rather than a full-fledged system design.
Given a file, I needed to implement a function to efficiently print the last 'n' lines from it.
Given a string s, find the longest palindromic substring in s.
You are allowed to complete at most two transactions. Find the maximum profit.
Given an array of integers, I needed to find all unique triplets such that their sum equals a specific target value, without sorting the array first.
Find the Lowest Common Ancestor (LCA) of two given nodes in a Binary Search Tree (BST).