Adobe MTS Interview Questions: 12 Experiences (Part 2 of 6)
- Company
- Adobe
- Level
- Full-time
- Stages
- Phone screen
Four 2024 Adobe MTS 2 first rounds set two or three problems each; heap and string tasks led, and one round was all JavaScript.
At a glance
- Process: a first technical round of two or three problems (60 minutes on HackerRank in MTS 04; about 30 minutes per problem in MTS 02), then one to three more rounds of coding, design and a manager or director (one for MTS 04, three for the others).
- Asked in these reports: a frequency sort and a heap check (MTS 02), the median of a stream (MTS 04), a throttled event handler (MTS 01) and LeetCode 2896 (MTS 03).
- Difficulty: medium to hard by the candidates' own account (MTS 03, MTS 04).
- Practise first: Sort Characters by How Often They Appear, Median of a Number Stream and Throttled Call Times.
Coverage: 12 experienced MTS-1 and MTS-2 candidates, mostly in Noida. Four are current (Jan to Sep 2024); eight from 2022 to Jul 2023 sit in History.
In this series
- Part 1: overview and question tables
- Part 2 (current): MTS-1 and MTS-2
- Part 3: SDE and senior software engineers
- Part 4: Computer Scientist 1
- Part 5: CS2 and senior Computer Scientist
- Part 6: frontend, quality, release and manager roles
What came up
In these four current reports, round one was hands-on coding every time. Two candidates met heap work (MTS 02, MTS 04), two had string problems (MTS 02, MTS 03), and one spent the whole round on JavaScript (MTS 01). Part 1 has the question tables.
4 detailed candidate timelines, loops, and screens
MTS 01: a JavaScript-heavy first round
Report date: Aug 2024 · Role: MTS 2 · Result: Not disclosed
Round 1: three JavaScript questions
- Reshape an object using destructuring.
- Write a polyfill for Promise.all.
- Scroll and window-resize events fire too often; throttle the handler, first with a simple version and then with timestamps. The timing rule is the core of Throttled Call Times.
Later rounds
- Lowest common ancestor in a binary tree; the critical rendering path and async loading; the event loop; call, apply and bind.
- Level-order traversal of a binary tree and past projects.
- Reverse the words of a long string; list every direct and connecting flight between two cities; invert a binary tree.
MTS 02: three time-boxed problems in round one
Interview date: Jul 2024 (rounds ran to Sep 2024) · Role: MTS 2 · Location: Noida · Result: Not disclosed
Round 1: problem solving and data structures
Each problem got about 30 to 35 minutes, and the interviewer kept the clock.
- Sort a string's characters so the most frequent come first, for example "tree" becomes "eert" (or "eetr"). Asked whether sorting could be avoided, the candidate covered count-then-sort, repeated maximum scans and a max-heap, then coded the heap in C++ (a typo broke the first run). They felt bucket sort was the wanted answer. Our version: Sort Characters by How Often They Appear.
- Decide whether a binary tree is a heap. The candidate gave the two conditions, said they knew it, and got a new problem. It is close to Is This Binary Tree a Max-Heap?.
- Decide whether a tic-tac-toe board could happen in a real game. Parsing the input in C++ was a struggle, and the interviewer noted the candidate never asked who moves first. Try it as Is This Tic-Tac-Toe Board Reachable.
Later rounds
- Java problem solving on a shared coding pad: next permutation (talk only); a binary search for the next number larger than a given value, then its edge cases; ways to climb n stairs taking 1 to k steps (the recurrence needed a fix). Then the candidate's most difficult project, monolith versus microservices and how microservices talk to each other, async versus sync calls, REST versus a plain API, and PUT versus PATCH.
- Low-level design: a cache with get and put whose eviction rule can be swapped, starting with LRU. Practise it as Refactor a Cache for Pluggable Eviction Policies.
- Hiring manager: a migration project from the candidate's past, a currency-conversion API with historical rates, Postgres index types, and what the candidate expected from the new role that the current one lacked.
MTS 03: a medium-to-hard pair
Report date: Mar 2024 · Role: MTS 2 (applied as SDE) · Location: Noida · Result: Offer
Round 1: two problems, medium to hard
- The longest continuous sequence in an array (exact rule not given); the candidate knew it and finished fast.
- LeetCode 2896, Apply Operations to Make Two Strings Equal: ten minutes on approaches, then code that passed the tests. Practise it as Cheapest Flips to Make Two Binary Strings Equal.
Later rounds
- A binary search whose middle index is random: which values does it still find?
- Engineering manager: OS concepts, current work and projects, a WhatsApp design, long-term goals and why Adobe fit them.
- Director: an airline system modelled as a graph, plus caching, on-call, monitoring and authentication.
MTS 04: two named LeetCode problems on HackerRank
Interview date: Jan 2024 · Role: C++ engineer, Illustrator team (MTS 2; 2 years as SDE I) · Location: Noida · Result: Rejected
Round 1: 60 minutes on HackerRank, one medium and one hard
- LeetCode 611, Valid Triangle Number: Count Triples That Can Form a Triangle.
- LeetCode 295, Find Median from Data Stream: Median of a Number Stream.
Round 2: LeetCode 48, Rotate Image, with a follow-up on doing it by transposing.
History (before Nov 2023)
Eight MTS reports from 2022 to Jul 2023, newest first.
MTS H01: a repeat-free substring first
Interview date: Jul 2023 · Role: MTS-2 · Result: Selected
- Round 1 (60 minutes online): an introduction and a talk about current work and its stack, then two medium hash-map string problems. One was LeetCode 3, longest substring without repeats, solved brute force first (our variant: First and Last Longest Repeat-Free Substrings); the other was not named.
- Later: an object-oriented chess game (Design a Chess Move Validation Model) and Kafka topics, partitions and brokers; a WhatsApp design; a database-as-a-service API with a SQL query, keys, SQL versus NoSQL, indexing and sharding; a behavioral round on the good and bad sides of past colleagues, plus scenario questions.
MTS H02: jumps that may go left
Report date: Dec 2022 · Role: MTS 2 · Location: Noida · Result: Offer
- Round 1: the fewest jumps from index 0 to the last index, where from index i you may land anywhere up to i + a[i] (Fewest Jumps to the End or Stuck). The follow-up allowed negative values that move left; the linked problem covers the forward-only version. Then merge sorted linked lists (the post is unclear whether two or k lists).
- Later: anagrams, rotting oranges and the 25-horses puzzle; language questions from the resume, the inorder predecessor with parent pointers and an increasing triplet; with the hiring manager, projects, expectations, a puzzle and a DP close to wildcard matching (closest practice: Match a Pattern With ? and *).
MTS H03: grid paths around blocks
Report date: Jul 2022 · Role: MTS-1 (9 months of experience) · Result: Withdrew before round 2
- Round 1: count the paths from the top-left to the bottom-right of a grid where 1 marks a blocked cell (Grid Paths Around Blocked Cells).
MTS H04: one DP problem
Interview date: May 2022 · Role: MTS-2 · Location: India · Result: Offer accepted
- Round 1: a dynamic programming problem that the candidate did not describe. Round 2 was API design; a later round covered promise chaining and the event loop.
MTS H05: five rounds, two named problems first
Interview date: 2022 (report date Apr 2022) · Role: MTS 2 (1 year 8 months) · Location: Noida · Result: Rejected after round 5
- Round 1: LeetCode 3 (our variant: First and Last Longest Repeat-Free Substrings) and LeetCode 1537 (Best Score Switching Between Two Sorted Arrays), plus C++ questions.
- Later: the rank of each number in a stream with a hand-built BST; movie booking design, the last n lines of a file and memory management; LeetCode 5 and 123; OS questions, sorting costs, 3-sum without sorting and LCA in a BST.
MTS H06: root-to-leaf numbers
Report date: Mar 2022 · Role: MTS-2 (about 3 years at a startup) · Location: Noida · Result: Offer
- Round 1 (60 minutes): project architecture, Java collections and concurrency, then LeetCode 129 (Sum of Numbers Along Root-to-Leaf Paths).
- Later: a problem like LeetCode 1011, and LeetCode 583; a parking-lot design with its APIs, sketched on a whiteboard both sides could edit, with choices on scaling, databases, caches and queues.
MTS H07: counting in a sorted array
Interview date: Feb 2022 · Role: MTS-2 (2 years as SDE1) · Location: Noida · Result: Offer
- Round 1 (1 hour): how often a value appears in a sorted array (Count Occurrences in a Sorted Array); whether a string splits into dictionary words (Can the Text Split Into Dictionary Words); the virtual keyword, singletons and threads.
- Later: a BST iterator and sorting a k-sorted array; single number, word search in a huge file, a no-repeat shuffle and the poisoned-wine puzzle; behavioral questions and an offensive-content filter design with the director.
MTS H08: a chocolate split and C++
Interview date: Jan 2022 · Role: MTS-2, C++ · Location: Noida · Result: Offer (declined)
- Round 1 (1 hour): a binary search that had to use exceptions for some cases; a variant of the chocolate distribution problem (Fairest Chocolate Packets); C++ and OS questions.
- Later: copy a list with random pointers, with tests; balanced brackets and a general Josephus circle; with the director, behavioral and project questions, OS and C++, and a reader-writer program run live.
Keep practicing
- Throttled Call Times: MTS 01.
- Binary Tree Level-Order Traversal by Levels: MTS 01.
- Mirror a Binary Tree: MTS 01.
- Sort Characters by How Often They Appear: MTS 02.
- Is This Binary Tree a Max-Heap?: MTS 02.
- Is This Tic-Tac-Toe Board Reachable: MTS 02.
- Refactor a Cache for Pluggable Eviction Policies: low-level design case, MTS 02.
- Cheapest Flips to Make Two Binary Strings Equal: MTS 03.
- Why do you want to work at Adobe?: behavioral question, MTS 03.
- Count Triples That Can Form a Triangle: MTS 04.
- Median of a Number Stream: MTS 04.
- First and Last Longest Repeat-Free Substrings: MTS H01, MTS H05.
- Design a Chess Move Validation Model: low-level design case, MTS H01.
- Fewest Jumps to the End or Stuck: MTS H02.
- Merge Two Sorted Linked Lists: MTS H02.
- Minutes Until All Oranges Rot: MTS H02.
- Match a Pattern With ? and *: MTS H02.
- Grid Paths Around Blocked Cells: MTS H03.
- Best Score Switching Between Two Sorted Arrays: MTS H05.
- Sum of Numbers Along Root-to-Leaf Paths: MTS H06.
- Count Occurrences in a Sorted Array: MTS H07.
- Can the Text Split Into Dictionary Words: MTS H07.
- Fairest Chocolate Packets: MTS H08.
- Are the Brackets Balanced: MTS H08.
- Adobe coding questions: all of Adobe's coding problems (sign-in needed).
- Adobe behavioral questions: Adobe's behavioral questions (sign-in needed).
- Adobe system design questions: Adobe's system design cases (sign-in needed).
- Adobe low-level design questions: Adobe's object design cases (sign-in needed).
- Adobe interview guide: the company's interview overview.
- Adobe hiring insights: hiring activity over time.
- Experience feed: more interview reports and roundups.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.