Adobe MTS-2 Interview Experience | DSA, System Design, DevOps & Hiring Manager Round

Gagan Bansal

Last Updated : 30 August 2026

374 Views

#interview

#adobe

#dsa

#interview-experience

#devops-automation

#interview-preparation

#technical-interview

#coding-interview

#experienced-candidate-interview

#interview-questions

Adℹ

I recently interviewed for the Member of Technical Staff 2 (MTS-2) role at Adobe. The hiring process took around 3–4 weeks and consisted of three technical rounds. The interviews covered a broad range of topics, including data structures and algorithms, system design, operating systems, databases, object-oriented programming, DevOps and project discussions.

Unlike interviews that focus solely on coding, Adobe evaluated both problem-solving ability and conceptual understanding across multiple domains. Here's a detailed breakdown of the interview process.

Interview Overview

Company	Adobe
Role	Member of Technical Staff 2 (MTS-2)
Interview Mode	Remote
Total Rounds	3
Hiring Timeline	3–4 Weeks
Difficulty	Medium
Result	Rejected

Round 1 – DSA + CS Fundamentals

The first interview started with a classic streaming data structure problem before moving into rapid-fire discussions covering several core Computer Science topics.

Coding Discussion – Median in a Data Stream

The interviewer asked how to continuously maintain the median of a stream of incoming integers. Instead of writing complete production code, the focus was on explaining the algorithm, discussing the intuition and writing pseudocode.

Key Observation

The median divides the numbers into two halves:

The smaller half
The larger half

If we can efficiently maintain these two halves, finding the median becomes trivial.

This leads to using two heaps.

Approach

The optimal solution uses two priority queues (heaps):

A max heap to store the smaller half of the numbers.
A min heap to store the larger half.

Whenever a new number arrives:

Insert it into the appropriate heap.
Rebalance the heaps if their sizes differ by more than one.
The median is either the top element of one heap or the average of both heap tops.


//Pseudocode
initialize maxHeap
initialize minHeap

function addNum(num)

    if maxHeap is empty OR num <= maxHeap.peek()
        maxHeap.add(num)
    else
        minHeap.add(num)
    if maxHeap.size > minHeap.size + 1
        minHeap.add(maxHeap.removeTop())

    else if minHeap.size > maxHeap.size + 1
        maxHeap.add(minHeap.removeTop())

------------------------------------------------

function findMedian()

    if both heaps are empty
        return "No elements"
    if sizes are equal
        return (maxHeap.top + minHeap.top) / 2.0
    if maxHeap larger
        return maxHeap.top
    return minHeap.top

Complexity

Insertion: O(log N)
Median Query: O(1)
Space Complexity: O(N)

The interviewer was interested in understanding why this approach works and how balancing the two heaps guarantees efficient median maintenance.

System Design Discussion

The conversation then shifted to distributed systems and scalability. Topics included:

Horizontal scaling
Load balancing
Concurrency
Performance bottlenecks
Designing scalable services
Handling increasing traffic

Rather than expecting a complete architecture, the interviewer focused on reasoning through design decisions and discussing trade-offs.

Database Management Systems (DBMS)

Several database concepts were discussed, including:

SQL vs NoSQL databases
Database normalization
Transaction atomicity
Locking mechanisms
Concurrency control
ACID properties
Isolation levels

Most questions were scenario-based and assessed conceptual understanding rather than memorization.

Operating Systems

The interviewer also covered operating system fundamentals. Discussion topics included:

Mutexes and locks
Synchronization
Isolation levels
Transaction management
Process concurrency

Object-Oriented Programming

The final topic in this round was designing an LRU Cache. Instead of asking for full code, the interviewer wanted a high-level design and pseudocode. The discussion covered:

HashMap + Doubly Linked List implementation
O(1) insertion and lookup
O(1) eviction
Design rationale
Time complexity

Overall, the interviewer valued clear explanations and design thinking more than writing lengthy code.

Round 2 – DSA + DevOps Discussion

The second interview began with coding problems before moving to infrastructure and DevOps concepts.

Problem 1 – Backtracking with Constraints

The first coding problem involved a constraint-based backtracking algorithm. Although the problem statement was lengthy, the underlying approach was based on recursive exploration while validating constraints at every decision point. The interviewer evaluated:

Recursive thinking
Constraint handling
Code organization
Debugging skills
Complexity analysis

The complete solution was implemented and tested against multiple cases during the interview.

Problem 2 – Friends of Appropriate Ages

The second question was the well-known Friends of Appropriate Ages problem. The task required determining the number of valid friend requests based on age-related constraints.

Problem Statement

Given an array ages, where ages[i] represents the age of the i-th person, determine the total number of friend requests sent.

A person x will not send a friend request to person y if any of the following conditions is true:

age[y] <= 0.5 * age[x] + 7
age[y] > age[x]
age[y] > 100 && age[x] < 100

If none of the above conditions hold, then x can send a friend request to y. A person cannot send a friend request to themselves.

Return the total number of valid friend requests.

My Approach

The algorithm maintains these invariants:

left always points to the first age greater than senderAge / 2 + 7.
right always points to the last age less than or equal to senderAge.
Every person between left and right satisfies:

senderAge / 2 + 7 < receiverAge <= senderAge

The sender is included in this range exactly once, so right - left counts all valid receivers except the sender.


import java.util.Arrays;

public class FriendsOfAppropriateAges {

    public static int numFriendRequests(int[] ages) {

        Arrays.sort(ages);

        int left = 0;
        int right = 0;
        int requests = 0;

        for (int i = 0; i < ages.length; i++) {

            int senderAge = ages[i];
            int lowerBound = senderAge / 2 + 7; // by age[y] <= 0.5 * age[x] + 7

            // No possible receiver exists
            if (lowerBound >= senderAge) // by age[y] > age[x]
                continue;

            // First age > lowerBound
            while (left < ages.length &&
                    ages[left] <= lowerBound) {
                left++;
            }

            // Last age <= senderAge
            while (right + 1 < ages.length &&
                    ages[right + 1] <= senderAge) {
                right++;
            }
            // Exclude sender itself
            if (right >= left) {
                requests += right - left;
            }
        }
        return requests;
    }

    public static void main(String[] args) {

        int[] ages = {16, 17, 18};

        System.out.println(numFriendRequests(ages));
    }
}

DevOps and Infrastructure Discussion

The coding section was followed by an in-depth discussion on software delivery and production infrastructure. Topics included:

Jenkins pipelines
CI/CD workflows
Build automation
Deployment strategies
Production debugging
AWS services
Docker
Kubernetes
Kafka
Monitoring and troubleshooting

The interviewer also asked about scripting and practical experiences with deployment automation and production support.

This round emphasized real-world engineering practices alongside algorithmic problem solving.

Round 3 – Hiring Manager Discussion

The final interview focused on project experience, ownership and technical leadership. The hiring manager explored:

Significant projects
Technical challenges
Ownership
Leadership experiences
Cross-team collaboration
Decision-making under pressure
Learning new technologies

A major discussion point was the actual nature of the role. The manager explained that the position involved substantial work related to:

Release engineering
Jenkins pipeline development
Build automation
Job scheduling

Since my primary interest was backend software development rather than release engineering, we discussed my prior exposure to these technologies and how I would approach learning areas where I had limited hands-on experience.

Scheduling Discussion

The interviewer also asked conceptual questions related to job scheduling. Topics included:

Scheduling tasks across multiple executors
Dependency management
Topological sorting
Detecting circular dependencies
Why cyclic dependency graphs cannot be scheduled

These questions assessed understanding of graph algorithms in practical engineering scenarios.

Overall Experience

The Adobe MTS-2 interview process covered a broad spectrum of software engineering concepts rather than focusing exclusively on coding. While data structures and algorithms formed the foundation of the technical interviews, significant emphasis was placed on system design, operating systems, databases, object-oriented design, DevOps practices and real-world engineering experience.

The interviewers valued clear communication, structured thinking and the ability to explain trade-offs. Many discussions revolved around architectural decisions, production systems and practical problem solving instead of simply arriving at the correct algorithm.

One important takeaway was ensuring that the responsibilities of the role align with your technical interests. During the hiring manager discussion, it became clear that the position was centered more on release engineering and CI/CD infrastructure than backend product development, which ultimately influenced my enthusiasm for the role.

Preparation Tips

If you're preparing for Adobe's MTS-2 interviews, focus on the following areas:

Arrays, Hashing, Heaps, Graphs and Backtracking
Streaming data structures (Median Finder, LRU Cache)
Object-Oriented Design
System Design fundamentals
Operating Systems and Concurrency
Database concepts (SQL, NoSQL, ACID, Isolation Levels)
CI/CD pipelines and Jenkins
Docker and Kubernetes
AWS fundamentals
Kafka and distributed messaging
Production debugging and troubleshooting

Practice explaining your solutions clearly, as interviewers often prioritize reasoning, design decisions and communication over writing lengthy code.

Final Verdict

Round 1: DSA + System Design + DBMS + OS + OOP
Round 2: Coding + DevOps Discussion
Round 3: Hiring Manager + Project Discussion

Overall Result: Rejected

Although the outcome was not positive, the interview experience was insightful and provided valuable exposure to a wide range of software engineering topics commonly evaluated in senior technical interviews.

Interview Overview

\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

Company	Adobe
Role	Member of Technical Staff 2 (MTS-2)
Interview Mode	Remote
Total Rounds	3
Hiring Timeline	3–4 Weeks
Difficulty	Medium
Result	Rejected

Round 1 – DSA + CS Fundamentals

The first interview started with a classic streaming data structure problem before moving into rapid-fire discussions covering several core Computer Science topics.

Coding Discussion – Median in a Data Stream

The interviewer asked how to continuously maintain the median of a stream of incoming integers.\nInstead of writing complete production code, the focus was on explaining the algorithm, discussing the intuition and writing pseudocode.

Key Observation

The median divides the numbers into two halves:

The smaller half
The larger half

If we can efficiently maintain these two halves, finding the median becomes trivial.

This leads to using two heaps.

Approach

The optimal solution uses two priority queues (heaps):

A max heap to store the smaller half of the numbers.
A min heap to store the larger half.

Whenever a new number arrives:

Insert it into the appropriate heap.
Rebalance the heaps if their sizes differ by more than one.
The median is either the top element of one heap or the average of both heap tops.

\n//Pseudocode\ninitialize maxHeap\ninitialize minHeap\n\nfunction addNum(num)\n\n    if maxHeap is empty OR num <= maxHeap.peek()\n        maxHeap.add(num)\n    else\n        minHeap.add(num)\n    if maxHeap.size > minHeap.size + 1\n        minHeap.add(maxHeap.removeTop())\n\n    else if minHeap.size > maxHeap.size + 1\n        maxHeap.add(minHeap.removeTop())\n\n------------------------------------------------\n\nfunction findMedian()\n\n    if both heaps are empty\n        return \"No elements\"\n    if sizes are equal\n        return (maxHeap.top + minHeap.top) / 2.0\n    if maxHeap larger\n        return maxHeap.top\n    return minHeap.top\n

Complexity

Insertion: O(log N)
Median Query: O(1)
Space Complexity: O(N)

The interviewer was interested in understanding why this approach works and how balancing the two heaps guarantees efficient median maintenance.

System Design Discussion

The conversation then shifted to distributed systems and scalability.\nTopics included:

Horizontal scaling
Load balancing
Concurrency
Performance bottlenecks
Designing scalable services
Handling increasing traffic

Rather than expecting a complete architecture, the interviewer focused on reasoning through design decisions and discussing trade-offs.

Database Management Systems (DBMS)

Several database concepts were discussed, including:

SQL vs NoSQL databases
Database normalization
Transaction atomicity
Locking mechanisms
Concurrency control
ACID properties
Isolation levels

Most questions were scenario-based and assessed conceptual understanding rather than memorization.

Operating Systems

The interviewer also covered operating system fundamentals.\nDiscussion topics included:

Mutexes and locks
Synchronization
Isolation levels
Transaction management
Process concurrency

Object-Oriented Programming

The final topic in this round was designing an LRU Cache.\nInstead of asking for full code, the interviewer wanted a high-level design and pseudocode.\nThe discussion covered:

HashMap + Doubly Linked List implementation
O(1) insertion and lookup
O(1) eviction
Design rationale
Time complexity

Overall, the interviewer valued clear explanations and design thinking more than writing lengthy code.

Round 2 – DSA + DevOps Discussion

The second interview began with coding problems before moving to infrastructure and DevOps concepts.

Problem 1 – Backtracking with Constraints

The first coding problem involved a constraint-based backtracking algorithm.\nAlthough the problem statement was lengthy, the underlying approach was based on recursive exploration while validating constraints at every\ndecision point.\nThe interviewer evaluated:

Recursive thinking
Constraint handling
Code organization
Debugging skills
Complexity analysis

The complete solution was implemented and tested against multiple cases during the interview.

Problem 2 – Friends of Appropriate Ages

The second question was the well-known Friends of Appropriate Ages problem.\nThe task required determining the number of valid friend requests based on age-related constraints.

Problem Statement

Given an array ages, where ages[i] represents the age of the i-th person, determine the total number of friend requests sent.

A person x will not send a friend request to person y if any of the following conditions is true:

age[y] <= 0.5 * age[x] + 7
age[y] > age[x]
age[y] > 100 && age[x] < 100

If none of the above conditions hold, then x can send a friend request to y.\nA person cannot send a friend request to themselves.

Return the total number of valid friend requests.

My Approach

The algorithm maintains these invariants:

left always points to the first age greater than senderAge / 2 + 7.
right always points to the last age less than or equal to senderAge.
Every person between left and right satisfies:

senderAge / 2 + 7 < receiverAge <= senderAge\n

The sender is included in this range exactly once, so right - left counts all valid receivers except the sender.

\nimport java.util.Arrays;\n\npublic class FriendsOfAppropriateAges {\n\n    public static int numFriendRequests(int[] ages) {\n\n        Arrays.sort(ages);\n\n        int left = 0;\n        int right = 0;\n        int requests = 0;\n\n        for (int i = 0; i < ages.length; i++) {\n\n            int senderAge = ages[i];\n            int lowerBound = senderAge / 2 + 7; // by age[y] <= 0.5 * age[x] + 7\n\n            // No possible receiver exists\n            if (lowerBound >= senderAge) // by age[y] > age[x]\n                continue;\n\n            // First age > lowerBound\n            while (left < ages.length &&\n                    ages[left] <= lowerBound) {\n                left++;\n            }\n\n            // Last age <= senderAge\n            while (right + 1 < ages.length &&\n                    ages[right + 1] <= senderAge) {\n                right++;\n            }\n            // Exclude sender itself\n            if (right >= left) {\n                requests += right - left;\n            }\n        }\n        return requests;\n    }\n\n    public static void main(String[] args) {\n\n        int[] ages = {16, 17, 18};\n\n        System.out.println(numFriendRequests(ages));\n    }\n}\n\n

DevOps and Infrastructure Discussion

The coding section was followed by an in-depth discussion on software delivery and production infrastructure.\nTopics included:

Jenkins pipelines
CI/CD workflows
Build automation
Deployment strategies
Production debugging
AWS services
Docker
Kubernetes
Kafka
Monitoring and troubleshooting

The interviewer also asked about scripting and practical experiences with deployment automation and production support.

This round emphasized real-world engineering practices alongside algorithmic problem solving.

Round 3 – Hiring Manager Discussion

The final interview focused on project experience, ownership and technical leadership.\nThe hiring manager explored:

Significant projects
Technical challenges
Ownership
Leadership experiences
Cross-team collaboration
Decision-making under pressure
Learning new technologies

A major discussion point was the actual nature of the role.\nThe manager explained that the position involved substantial work related to:

Release engineering
Jenkins pipeline development
Build automation
Job scheduling

Since my primary interest was backend software development rather than release engineering, we discussed my prior exposure to these technologies and\nhow I would approach learning areas where I had limited hands-on experience.

Scheduling Discussion

The interviewer also asked conceptual questions related to job scheduling.\nTopics included:

Scheduling tasks across multiple executors
Dependency management
Topological sorting
Detecting circular dependencies
Why cyclic dependency graphs cannot be scheduled

These questions assessed understanding of graph algorithms in practical engineering scenarios.

Overall Experience

Preparation Tips

If you're preparing for Adobe's MTS-2 interviews, focus on the following areas:

Arrays, Hashing, Heaps, Graphs and Backtracking
Streaming data structures (Median Finder, LRU Cache)
Object-Oriented Design
System Design fundamentals
Operating Systems and Concurrency
Database concepts (SQL, NoSQL, ACID, Isolation Levels)
CI/CD pipelines and Jenkins
Docker and Kubernetes
AWS fundamentals
Kafka and distributed messaging
Production debugging and troubleshooting

Practice explaining your solutions clearly, as interviewers often prioritize reasoning, design decisions and communication over writing lengthy code.

Final Verdict

Round 1: DSA + System Design + DBMS + OS + OOP
Round 2: Coding + DevOps Discussion
Round 3: Hiring Manager + Project Discussion

Overall Result: Rejected

","categoryId":363,"subCategoryId":145,"contentFormat":5,"blogId":156,"userId":"MjlfNF84LVsxNzBdMm4tdENfQU5nZV9fSXQ=","title":"Adobe MTS-2 Interview Experience | DSA, System Design, DevOps & Hiring Manager Round","url":"adobe-mts-2-interview-experience-dsa-system-design-devops-hiring-manager-round","bannerImage":"","seoDescription":"Adobe MTS-2 interview experience with DSA, system design, DevOps, DBMS, OS, OOP, hiring manager round, coding questions and preparation tips.","generatedOn":"2026-07-15T06:33:37","updatedOn":"2026-08-30T06:46:30"},"popularContents":[{"id":166,"title":"System Design Interview – BIGGEST Mistakes to Avoid","url":"system-design-interview-biggest-mistakes-to-avoid","description":null,"seoDescription":"Learn the biggest mistakes to avoid in a system design interview, from unclear requirements to poor trade-off analysis. Includes real-world cases, advanced insights and examples to help you ace your next system design interview.","contentType":2,"generatedOn":"2026-10-14T22:54:04.0390935Z","viewCount":0},{"id":35,"title":"Cursor vs Copilot : Which AI Coding Assistant Wins in 2025?","url":"cursor-vs-copilot-which-ai-coding-assistant-truly-wins-in-2025","description":null,"seoDescription":"Compare Cursor vs GitHub Copilot on speed, context awareness, multi-file support, pricing and code quality to choose the best AI coding assistant for developers","contentType":5,"generatedOn":"2026-10-14T22:54:04.0397507Z","viewCount":0},{"id":173,"title":"Uber SDE-2 Interview Experience : LLD, HLD, DSA & Hiring Manager Round","url":"uber-sde-2-interview-experience-lld-hld-dsa-hiring-manager-round","description":null,"seoDescription":"Read a real Uber SDE-2 interview experience covering DSA, low-level design, high-level system design, behavioral rounds, hiring freeze and key takeaways.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0397608Z","viewCount":0},{"id":139,"title":"Blinkit (Eternal) SDE-1 Interview Experience (June 2026) – Offer Received","url":"blinkit-eternal-sde-1-interview-experience-june-2026-offer-received","description":null,"seoDescription":"Blinkit SDE-1 interview experience with a 30 LPA offer. Covers House Robber DP, ticket booking system design, culture fit round and tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.039759Z","viewCount":0},{"id":197,"title":"My Adobe SDE Interview Experience (Aug 2026) 5 Rounds, Selected","url":"my-adobe-sde-interview-experience-aug-2026-5-rounds-selected","description":null,"seoDescription":"Real Adobe SDE interview: 5 rounds, 4 DSA problems (Rotate Array, BSTs, Kth Smallest Matrix), code review & behavioral round. Full solutions + tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.039762Z","viewCount":0},{"id":83,"title":"Uber SDE 2 Interview Experience (5 Rounds, Selected) - Complete DSA Questions with solution, System Design & Managerial Round","url":"uber-sde-2-interview-experience","description":null,"seoDescription":"Uber SDE 2 interview experience with 5 rounds, real DSA questions, system design, coding round, and preparation tips to crack Uber interviews.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0397522Z","viewCount":0},{"id":138,"title":"DSA Patterns for Coding Interviews: Complete LeetCode Roadmap (Beginner to Advanced)","url":"dsa-patterns-for-coding-interviews-complete-leetcode-roadmap-beginner-to-advanced","description":null,"seoDescription":"Master every LeetCode pattern for coding interviews. Learn Arrays, Sliding Window, Graphs, Dynamic Programming, Trees, Heaps and more with 250+ curated problem","contentType":5,"generatedOn":"2026-10-14T22:54:04.0397577Z","viewCount":0},{"id":130,"title":"Rippling SDE-2 Interview Experience (4+ Years Experience) | Offer Received | Coding, LLD & System Design","url":"rippling-sde-2-interview-experience-4-years-experience-offer-received-coding-lld-system-design","description":null,"seoDescription":"Detailed Rippling SDE-2 interview experience with complete 5 rounds, coding questions, rules engine design, system design and preparation tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0397564Z","viewCount":0},{"id":165,"title":"Top 50+ SQL Interview Questions and Answers for Intermediate to Advanced","url":"top-sql-interview-questions-and-answers-for-intermediate-to-advanced","description":null,"seoDescription":"Top SQL Interview Questions and Answers for Intermediate to Advanced. Top SQL Interview Questions for experience. Frequently asked SQL interview questions with answers","contentType":2,"generatedOn":"2026-10-14T22:54:04.0390863Z","viewCount":0},{"id":34,"title":"System Design Deep Dive: 25 Essential Interview Questions","url":"system-design-deep-dive-25-essential-interview-questions","description":null,"seoDescription":"","contentType":5,"generatedOn":"2026-10-14T22:54:04.0397484Z","viewCount":0}],"latestContents":[{"id":219,"title":"6 Tools That Made My Life Easier as a Software Engineer","url":"6-tools-that-made-my-life-easier-as-a-software-engineer","description":null,"seoDescription":"The 6 developer tools I use daily as a software engineer: Git, VS Code, Docker, Postman, Chrome DevTools, and AI assistants, with real tips, mistakes, and trade","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342193Z","viewCount":0},{"id":218,"title":"When Should a Business Use Multiple AI Agents Instead of One?","url":"when-should-a-business-use-multiple-ai-agents-instead-of-one","description":null,"seoDescription":"Single agent or multi-agent AI? Learn the 4 signals that justify splitting agents by knowledge, permissions, and risk, plus routing and handoff tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342233Z","viewCount":0},{"id":216,"title":"AI in Clinical Trials Market Estimated to Experience a Hike in Growth by 2035","url":"ai-in-clinical-trials-market-estimated-to-experience-a-hike-in-growth-by-2035","description":null,"seoDescription":"The exclusive information about market dynamics serves as a valuable guide to predict economic scenarios and initiatives taken to enhance future growth. Our mar","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342284Z","viewCount":0},{"id":217,"title":"AI in Clinical Trials Market Estimated to Experience a Hike in Growth by 2035","url":"ai-in-clinical-trials-market-estimated-to-experience-a-hike-in-growth-by-2035","description":null,"seoDescription":"The exclusive information about market dynamics serves as a valuable guide to predict economic scenarios and initiatives taken to enhance future growth. Our mar","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342299Z","viewCount":0},{"id":215,"title":"What Happens When an AI Agent Doesn't Know the Answer?","url":"what-happens-when-an-ai-agent-doesnt-know-the-answer","description":null,"seoDescription":"Most AI agents fail quietly. They guess instead of saying \"I don't know.\" Here's how to design better fallback and human-handoff behavior.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342314Z","viewCount":0},{"id":214,"title":"Greedy Algorithms Explained: How They Work, When They Fail and How to Use Them","url":"greedy-algorithms-explained-how-they-work-when-they-fail-and-how-to-use-them","description":null,"seoDescription":"Learn greedy algorithms step by step with C# code Dijkstra, Huffman coding, knapsack and MSTs plus when greedy fails and how to prove it's correct","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342328Z","viewCount":0},{"id":213,"title":"Amazon SDE II Interview Experience (Bangalore, Selected) ~ Aug 2026","url":"amazon-sde-ii-interview-experience-bangalore-selected-aug-2026","description":null,"seoDescription":"Amazon SDE II interview experience from Bangalore covering 4 rounds, DSA, LLD, system design, Leadership Principles, coding questions and selection.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342343Z","viewCount":0},{"id":212,"title":"How to Get 10x Better AI Answers Without Writing Better Prompts : 10 Proven Techniques","url":"how-to-get-10x-better-ai-answers-without-writing-better-prompts-10-proven-techniques","description":null,"seoDescription":"Get better AI answers without complex prompts. Learn 10 practical techniques using context, examples, tools, feedback, and verification.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342358Z","viewCount":0},{"id":211,"title":"I Interviewed for a Microsoft SDE I Role. Here's Everything That Happened.","url":"i-interviewed-for-a-microsoft-sde-i-role-heres-everything-that-happened","description":null,"seoDescription":"My real Microsoft SDE I interview experience, all 4 rounds, the exact DSA problems with fully tested solutions, the WhatsApp system design round","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342374Z","viewCount":0},{"id":140,"title":"PolicyBazaar Software Development Engineer (SDE) Interview Experience | DSA, Core CS & System Design","url":"policybazaar-software-development-engineer-sde-interview-experience-dsa-core-cs-system-design","description":null,"seoDescription":"Detailed PolicyBazaar SDE interview experience covering 3 rounds: DSA coding, core CS assessment and system design with key learnings and insights.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0342387Z","viewCount":0}],"relatedContents":[{"id":209,"title":"Adobe Computer Scientist 1 Interview Experience: Real Questions, Solutions & Tips","url":"adobe-computer-scientist-1-interview-experience-real-questions-solutions-tips","description":null,"seoDescription":"Real Adobe CS-1 interview experience covering C++, DSA questions, coding solutions, reschedules, rejection, interview challenges and preparation tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489785Z","viewCount":0},{"id":180,"title":"My Adobe Interview Experience for Android MTS-2 (SDE-III Level) ~ Full Breakdown","url":"my-adobe-interview-experience-for-android-mts-2-sde-iii-level-full-breakdown","description":null,"seoDescription":"Adobe MTS-2 Android interview experience covering Android basics, coroutines, DSA, system design, hiring manager round, coding questions and tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489827Z","viewCount":0},{"id":12,"title":"Adobe Software Engineer 2 Interview Experience","url":"adobe-software-engineer-2-interview-experience","description":null,"seoDescription":"Adobe SDE-2 interview experience with DSA, LLD, Java, C++, LRU Cache, coding questions, solutions, interview rounds and preparation tips","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489856Z","viewCount":0},{"id":13,"title":"Adobe Software Engineer 2 Interview Experience","url":"adobe-software-engineer-2-interview-experience","description":null,"seoDescription":"Adobe SDE-2 interview experience with Java, DSA, SQL, API basics, testing, behavioral rounds, coding questions, solutions and preparation tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489871Z","viewCount":0},{"id":197,"title":"My Adobe SDE Interview Experience (Aug 2026) 5 Rounds, Selected","url":"my-adobe-sde-interview-experience-aug-2026-5-rounds-selected","description":null,"seoDescription":"Real Adobe SDE interview: 5 rounds, 4 DSA problems (Rotate Array, BSTs, Kth Smallest Matrix), code review & behavioral round. Full solutions + tips.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489888Z","viewCount":0},{"id":213,"title":"Amazon SDE II Interview Experience (Bangalore, Selected) ~ Aug 2026","url":"amazon-sde-ii-interview-experience-bangalore-selected-aug-2026","description":null,"seoDescription":"Amazon SDE II interview experience from Bangalore covering 4 rounds, DSA, LLD, system design, Leadership Principles, coding questions and selection.","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489903Z","viewCount":0},{"id":211,"title":"I Interviewed for a Microsoft SDE I Role. Here's Everything That Happened.","url":"i-interviewed-for-a-microsoft-sde-i-role-heres-everything-that-happened","description":null,"seoDescription":"My real Microsoft SDE I interview experience, all 4 rounds, the exact DSA problems with fully tested solutions, the WhatsApp system design round","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489916Z","viewCount":0},{"id":140,"title":"PolicyBazaar Software Development Engineer (SDE) Interview Experience | DSA, Core CS & System Design","url":"policybazaar-software-development-engineer-sde-interview-experience-dsa-core-cs-system-design","description":null,"seoDescription":"Detailed PolicyBazaar SDE interview experience covering 3 rounds: DSA coding, core CS assessment and system design with key learnings and insights.","contentType":5,"generatedOn":"2026-10-14T22:54:04.048993Z","viewCount":0},{"id":135,"title":"Spinny SDE-1 Interview Experience (Selected)","url":"spinny-sde-1-interview-experience-selected","description":null,"seoDescription":"Spinny SDE-1 Interview Experience (Selected) | 4 Rounds Breakdown: Coding, LLD, Java, SQL + Real Interview Questions","contentType":5,"generatedOn":"2026-10-14T22:54:04.0489965Z","viewCount":0}]}}},"source":{"isMobile":false}}; window.__CLIENT_RENDER__ = false;

Adobe MTS-2 Interview Experience | DSA, System Design, DevOps & Hiring Manager Round

Interview Overview

Round 1 – DSA + CS Fundamentals

Coding Discussion – Median in a Data Stream

Key Observation

Approach

Complexity

System Design Discussion

Database Management Systems (DBMS)

Operating Systems

Object-Oriented Programming

Round 2 – DSA + DevOps Discussion

Problem 1 – Backtracking with Constraints

Problem 2 – Friends of Appropriate Ages

Problem Statement

My Approach

DevOps and Infrastructure Discussion

Round 3 – Hiring Manager Discussion

Scheduling Discussion

Overall Experience

Preparation Tips

Final Verdict

Trending Developer Reads

Interview Overview

Round 1 – DSA + CS Fundamentals

Coding Discussion – Median in a Data Stream

Key Observation

Approach

Complexity

System Design Discussion

Database Management Systems (DBMS)

Operating Systems

Object-Oriented Programming

Round 2 – DSA + DevOps Discussion

Problem 1 – Backtracking with Constraints

Problem 2 – Friends of Appropriate Ages

Problem Statement

My Approach

DevOps and Infrastructure Discussion

Round 3 – Hiring Manager Discussion

Scheduling Discussion

Overall Experience

Preparation Tips

Final Verdict