Adobe MTS Round 1 Interview Reports: 7 Experiences (Part 3 of 12)
- Company
- Adobe
- Reports
- 7 interview reports
- Level
- Full-time
- Stages
- Phone screen
Adobe MTS round 1 from Nov 2024 to May 2025 mixed one or two coding problems with questions on past work and CS fundamentals.
At a glance
- Process: one technical round first, sometimes as an elimination round (11, one hour). Candidate 11 had an HR screen before it, and 09's hiring drive ran every round in one day. Later rounds were LLD (09, 12, 13), hiring manager and sometimes a director (11, 12).
- Asked recently: past work or projects in 5 of 7 (10, 11, 13, 14, 15), CS fundamentals in 4 (databases, OS, Java threads, S3), and trees or hierarchies in 2 (Hubs With the Shortest Longest Chain in 09, Everyone Under a Manager in 12).
- Difficulty: no one rated the round. Candidate 12 felt it went well and was still rejected later; 14 was cut after round 1. Four of the seven got offers (09, 10, 11, 13).
- Practise first: Hubs With the Shortest Longest Chain, Everyone Under a Manager, Longest Substring Without Repeats and Its Text and Search an Unbounded Sorted Array.
Coverage: 7 reports, six MTS-2 and one MTS-1 (11), from Nov 2024 to May 2025, in India where a place was given (Noida in 15). The series covers 69 experienced-hire reports, first technical round only; tables count only round-one questions.
In this series
- Part 1: overview — the process, most-asked problems and a guide to every role
- Part 2: MTS-2, Jun 2025–Sep 2026 — 8 MTS-2 reports, entries 01–08
- Part 3 (current): MTS-1 and MTS-2, Nov 2024–May 2025
- Part 4: Computer Scientist 1, Jul 2025–Aug 2026 — 8 CS-1 reports, entries 16–23
- Part 5: Computer Scientist 1, Dec 2024–Aug 2025 — 7 more CS-1 reports, entries 24–30
- Part 6: CS-2 and Senior Computer Scientist — 4 reports, entries 31–34
- Part 7: SDE, SE2 and senior engineers — 8 reports, entries 35–42
- Part 8: C++ engineers — 9 reports, entries 43–51
- Part 9: frontend engineers — 10 reports, entries 52–61
- Part 10: Android engineers — 3 reports, entries 62–64
- Part 11: machine learning engineers — 3 reports, entries 65–67
- Part 12: release engineering and product consultant — 2 reports, entries 68–69
What came up
Talk about the candidate's own work was the most common thread here, ahead of any single coding topic.
| Topic | Reports | Last seen |
|---|---|---|
| Past work and projects | 5 of 7 | Apr 2025 (report date) |
| CS fundamentals (databases, OS, Java, S3) | 4 of 7 | Apr 2025 (report date) |
| Trees and hierarchies | 2 of 7 | May 2025 |
| Strings and hashing | 2 of 7 | May 2025 |
| Arrays | 2 of 7 | Apr 2025 (report date) |
| Binary search | 1 of 7 | Dec 2024 (report date) |
| Counting with Java Streams | 1 of 7 | Nov 2024–May 2025 |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Count Sentences From Anagram Swaps | 1: 09 | May 2025 |
| Hubs With the Shortest Longest Chain (LeetCode 310) | 1: 09 | May 2025 |
| Do the Range Decrements Zero the Array | 1: 10 | Apr 2025 (report date) |
| First and Last Longest Repeat-Free Substrings (LeetCode 3) | 1: 11 | Apr 2025 (report date) |
| Everyone Under a Manager | 1: 12 | Feb 2025 (report date) |
| Search an Unbounded Sorted Array (LeetCode 702 family) | 1: 13 | Dec 2024 (report date) |
| Print an element chosen by frequency with Java Streams (rule not given) | 1: 14 | Nov 2024–May 2025 |
| Two Non-Overlapping Increasing Blocks (LeetCode 3349, then LC 3350 for the largest k) | 1: 15 | Nov 2024 |
Language and CS Fundamentals
| Question | Reports | Last seen |
|---|---|---|
| DBMS (ACID, locks, indexing), OS (deadlocks, multithreading) and load balancing | 1: 11 | Apr 2025 (report date) |
7 MTS round 1 reports
09: MTS-2 hiring drive: anagram sentences and tree hubs
Interview date: May 27, 2025 · Role: MTS-2 · Experience: 2 years 1 month · Result: Offer
Round 1: Problem solving (first technical round)
- All rounds ran on one day as part of a hiring drive.
- Count Anagram Sentences: given a word list and m sentences, count for each sentence how many sentences you can make by swapping each word for any anagram of it from the list. Return one count per sentence. One example list was listen, silent, it, is.
- Hubs That Minimize the Longest Reporting Chain (LC 310): an org tree of n departments joined by n-1 undirected edges. Return every department that, used as the center, makes the tree as short as possible. For a star around node 1 the answer is [1]; another example had two answers, [3, 4].
- The candidate answered both. The email for round 2 arrived about ten minutes later.
After round 1: Round 2 asked the tree-hub problem again (now in O(n)) plus top k most viewed product IDs. Round 3 was LLD of a notification service for SMS, WhatsApp and push. The hiring manager round covered microservices vs monolith and disagreeing with leadership. The candidate felt it was a lean hire, but an offer followed.
10: MTS-2 with an ML background: range decrements, S3 and ML talk
Report date: Apr 14, 2025 · Role: MTS-2 · Experience: 2+ years · Result: Offer
Round 1: First round (first technical round)
- A recruiter set it up.
- Can range decrements make the array zero: an array of positive numbers and a list of (i, j) ranges. Each range lowers every element inside it by 1. Say whether the whole array can end at zero.
- Questions about Amazon S3. The exact questions weren't shared.
- ML questions tied to the candidate's own background, also not listed.
After round 1: Round 2 was the celebrity problem and a design for a universal query maker. Round 3, which the candidate felt was their worst, had subsets, resume talk, a chat-completion API signature and test cases. The manager round had cousins in an n-ary tree, a rough design of a Flask app and behavioral questions. The offer call came two or three days later.
11: MTS-1 after one year: longest unique substring and core CS
Report date: Apr 6, 2025 · Role: MTS-1 · Experience: 1 year · Result: Offer (accepted)
Before the first technical round: An HR phone screen covered the job profile, the candidate's experience and scheduling.
Round 1: Technical round I (first technical round)
- One hour, and it was an elimination round.
- Detailed questions on projects from the candidate's previous company.
- Longest Substring Without Repeats and Its Text (LC 3): find the length with a sliding window, then print the first or last substring that has that length.
- Core CS: ACID, locks and indexing in databases; deadlocks and multithreading in operating systems; load balancing in distributed systems.
- The candidate passed.
After round 1: Technical round II (40 minutes) asked for a binary tree's diameter, including writing the node class, plus pass-by-reference in Java vs C++. A 70-minute manager round mixed next greater element, producer-consumer, REST design and a lift system. A director round asked for full KMP and Kadane code. The candidate was selected and accepted.
12: MTS-2: everyone under a manager, then trees vs graphs
Report date: Feb 27, 2025 · Role: MTS-2 · Result: Rejected
Round 1: Problem solving and data structures (first technical round)
- All employees under a manager: a table of employee name, manager name and salary. Return every employee who reports to a given manager, directly or through others.
- The candidate used BFS over the hierarchy.
- Follow-ups: should this be a tree or a graph, what is the real difference, what do both cost, and when would you pick each.
- The candidate answered all of them and felt the round went well.
After round 1: Round 2 was LLD: a past project, then an elevator you call from outside by picking a floor, starting with the database. A manager round went deep on experience. The director, camera off, asked for a secret vault design with encryption (symmetric vs asymmetric) and microservice resilience, plus LCA in an n-ary tree, which the candidate solved with root-to-node paths. The result was a rejection.
13: MTS-2 with 2.5 years: searching a sorted array with no end
Report date: Dec 23, 2024 · Role: MTS-2 · Experience: 2.5 years · Result: Offer
Round 1: DSA (first technical round)
- Search an unbounded sorted array in O(log n): the array has no known end (LC 702 family).
- A second problem the candidate could no longer remember.
- Talk about previous work and database internals.
After round 1: Round 2 asked for the largest number from concatenation (LC 179) without calling sort, by writing merge sort with a custom merge, then Trapping Rain Water II, two SQL queries and past work. Round 3 was LLD of a car rental system with schema, modular code and queries. The manager round covered a current project's design, LCA in an n-ary tree via an Euler tour, and a complex schema. The candidate was selected.
14: MTS-2 Java on a first job switch: out after round 1
Interview date: between Nov 22, 2024 and May 21, 2025 (exact date not given) · Role: MTS-2 (Java) · Result: Eliminated in round 1
Round 1: CS fundamentals, Java and coding (first technical round)
- This was the candidate's first job switch.
- About 30 minutes went to a deep dive on a project. Which project, and the exact questions, weren't shared.
- Then an operating systems question, core Java and thread pools. The specific questions weren't listed.
- A short coding task: print an element picked by its frequency, using Java Streams. The frequency rule, input and output weren't given.
- The candidate was eliminated after this round.
15: MTS-2 Java: two increasing subarrays, then the largest k
Interview date: Nov 2024 · Role: MTS-2 (Java) · Experience: 2+ years · Location: Noida, India · Result: Not selected
Round 1: Problem solving (first technical round)
- This was the candidate's first Adobe interview. It opened with an intro and questions on their company projects.
- Two non-overlapping increasing subarrays: decide whether the array has two adjacent, non-overlapping, strictly increasing subarrays of length k (LC 3349).
- Follow-up on the same setup: find the largest k for which two such subarrays exist (LC 3350).
After round 1: Round 2 was problem solving in Java: concurrency, race conditions and the reader-writer problem, a concurrent hashmap with get, put and delete, and lock/unlock on a tree with parent pointers, where a node can be locked only if no ancestor or descendant is locked. The candidate was not selected.
Common questions
Is the Adobe MTS first round an elimination round?
For some candidates it was. Candidate 11's one-hour round was described as an elimination round, and 14 was eliminated after theirs; 09 got the round-two email about ten minutes after finishing.
What CS fundamentals does Adobe ask MTS candidates?
Databases came up most: ACID, locks and indexing (11) and database internals (13). Candidate 11 also had OS deadlocks and multithreading, 14 had OS, core Java and thread pools, and 10 had questions about Amazon S3.
Keep practicing
- Practice from these reports: Count Anagram Sentences (09); Hubs That Minimize the Longest Reporting Chain (09); Can range decrements make the array zero (10); Longest Substring Without Repeats and Its Text (11); All employees under a manager (12); Search an unbounded sorted array (13); the largest number from concatenation (13); Two non-overlapping increasing subarrays (15).
- Adobe coding bank: every Adobe algorithm problem in the question bank (sign-in needed).
- Adobe overview: the Adobe interview page and Adobe hiring insights.
- More reports: the Experience feed.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.