adobe logo
Adobe· MTS-1

Adobe MTS-1(1 year experience) Interview Process

Experience
1 year
Posted
6 Apr 2025
400 reads

Summary

I interviewed for the MTS-1 role at Adobe, which involved four technical rounds covering data structures, algorithms, core computer science concepts, project discussions, and system design. I successfully cleared all rounds and accepted the offer.

How it went

The interview process for the MTS-1 role consisted of four technical rounds, starting with an initial phone screening by HR. The HR representative explained the job profile, collected details on relevant experience, and scheduled the upcoming interviews.

Round 1 and Round 2 were technical interviews focused on data structures, algorithms, and core computer science concepts.

Round 3 was a managerial round, which involved both technical deep-dives and project-related discussions.

Round 4 was the Director's round and interviewer was a senior manager, where both technical knowledge and career motivations were evaluated.

Each round progressively increased in depth and complexity and each one was elimination round. After clearing all rounds, a final confirmation call was made by HR informing the selection for the role.

Questions asked (14)

  1. 01

    Longest Substring Without Repeating Characters

    Data Structures & Algorithms

    A DSA question was asked on finding the length of the longest substring without repeating characters using the sliding window technique, followed by printing either the first or last such substring.

  2. 02

    DBMS: ACID properties, Locks, Indexing

    Other

    Questions were asked from DBMS (ACID properties, locks, indexing).

  3. 03

    Operating Systems: Deadlocks, Multithreading

    Other

    Questions were asked from Operating Systems (deadlocks, multithreading).

  4. 04

    Distributed Systems: Load Balancing

    Other

    Questions were asked from Distributed Systems (load balancing).

  5. 05

    Diameter of Binary Tree

    Data Structures & Algorithms

    I was asked to find the diameter of a binary tree, including the class construction.

  6. 06

    Pass-by-reference in Java and C++

    Other

    Conceptual questions on pass-by-reference and how it works in Java and C++.

  7. 07

    Next Greater Element

    Data Structures & Algorithms

    The interviewer asked the Next Greater Element question along with a detailed dry run.

  8. 08

    Multithreading in Java and C++

    Other

    Topics such as multithreading in Java and C++ were covered.

  9. 09

    JavaScript Async/Await and Asynchronous Operations

    Other

    Topics such as JavaScript’s async/await behavior, and how JS handles asynchronous operations in a single-threaded environment were covered.

  10. 10

    Producer-Consumer Problem

    Other

    The producer-consumer problem and its solutions were discussed.

  11. 11

    REST APIs, HTTPS Requests, API Design, API Contracts

    Other

    Questions on REST APIs, HTTPS requests, API design, and API contracts.

  12. 12

    Design a Lift System

    System Design

    A system design question on designing a lift system.

  13. 13

    KMP Algorithm

    Data Structures & Algorithms

    Two DSA questions were asked: KMP Algorithm, which required complete code implementation.

  14. 14

    Kadane’s Algorithm

    Data Structures & Algorithms

    Two DSA questions were asked: Kadane’s Algorithm, which required complete code implementation.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Adobe recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!