Adobe | MTS-2 | 2025
Summary
I received an offer for the MTS-2 role at Adobe after a 3-week interview process consisting of four rounds focusing on coding, system design, and project discussions.
Full Experience
Previous Experience: a MNC(2+ Years)
Recruited reached out directly.
Whole process took 3 weeks from the first interview to last.
1st Round: 1 coding question(given i/p arr of len n of all positve numbers. You need to check if you can convert it to a zero array. You are also given a 2d array of queries having elements as (i, j) representing range. This is the range where we will be reducing the numbers in the original array by 1. Return if a zero array could be formed) + question about amazon s3 and some ML questions(due to my ML background)
2nd round: 1 coding question (https://www.naukri.com/code360/problems/the-celebrity-problem_982769) + design a universal query maker.
3rd round: 1 coding question(https://leetcode.com/problems/subsets/description/)+ questions on resume + questions on past projects + creating an api signiture for a chat completion + give positive and negative test cases for the api.(This was the worst round I had)
4th round: 1 coding question( https://leetcode.com/problems/cousins-in-binary-tree/ but instead of a binary tree an N-ary tree was given)
questions about resume, past projects, rough HLD about a basic flask app, behavioral questions. (This was the best round I had)
Verdict: Recieved the call from the recruiter after a 2-3 days with an offer.
Interview Questions (9)
Given an input array of length 'n' of all positive numbers. You need to check if you can convert it to a zero array. You are also given a 2D array of queries having elements as (i, j) representing range. This is the range where we will be reducing the numbers in the original array by 1. Return if a zero array could be formed.
Question about Amazon S3.
The problem can be found at: https://www.naukri.com/code360/problems/the-celebrity-problem_982769
Design a universal query maker.
The problem can be found at: https://leetcode.com/problems/subsets/description/
Creating an API signature for a chat completion.
Give positive and negative test cases for the API.
A variant of the LeetCode problem "Cousins in Binary Tree" (https://leetcode.com/problems/cousins-in-binary-tree/) but instead of a binary tree an N-ary tree was given.
Rough HLD about a basic flask app.