Adobe New Grad MTS Interview Questions: 7 Experiences
- Company
- Adobe
- Level
- New Grad
- Stages
- Phone screen
Seven Adobe new-grad MTS and SDE-1 reports, all from 2022 interviews, show first rounds of one to three coding problems; three added OS or DBMS questions.
At a glance
- No current reports: none of the new-grad interviews in this set took place in the last three years (H03 wrote up its 2022 interview in 2025). All seven are in History below, each with its questions and practice links.
- Newer Adobe reports: see the experienced hire, intern and level not reported roundups from Nov 2024 on.
Coverage: seven new-grad MTS-1, MTS and SDE-1 candidates, on and off campus. All seven interviews took place in 2022: four give the interview month (H01, H03, H05, H07), three were posted in 2022 without one (H02, H04, H06), and H03 wrote its account up in Jun 2025. One says it was in India (H06); the others give no location. Other cohorts: experienced hires · interns · hiring level not reported. Reports from Nov 2024 on have their own roundups: experienced hires · interns · level not reported.
What came up
No new-grad interview in this set is newer than 2022, so the topic and question tables are left out and every question stays in its entry below.
Common questions
How many rounds did the 2022 new-grad candidates have?
In the 2022 reports, two live rounds for H01, H06 and H07, and three for H02, H03, H04 and H05. Four had an online test first (H01, H02, H04, H05), and H06's first round was a similar 90-minute set of coding, maths, logic and English questions.
Were OS and DBMS questions part of the 2022 first rounds?
In three of the seven 2022 reports: reentrancy and caching (H01), indexing, isolation and sorting stability (H03), and semaphores and threads (H06). H07 opened with questions on the candidate's own tech stack instead.
How hard did the 2022 candidates find it?
Five of the 2022 reports give a rating: H01 called its first live round medium, H07's round one started easy and got harder, H04 called its online test medium, H06 called its first-round coding questions easy to medium, and H05 found its test not that hard.
History (before Nov 2023)
H01: a rotated array, then puzzles
Interview date: Aug 2022 · Role: SDE-1 (on campus) · Result: Selected
- Online test (90 minutes): five maths and probability questions and three coding problems.
- Round 2 (50 minutes, face to face), which the candidate rated medium: LeetCode 33, solved with binary search on the sorted half after weighing three approaches (Search a Rotated Sorted Array); then OS questions on reentrant code, cache memory and aging.
- Round 3 (50 minutes): the longest common prefix of a list of words, by sorting and comparing the first and last; two puzzles, splitting ten coins blindfolded into piles with equal heads, and three switches for three bulbs.
H02: a tree's boundary in one pass
Report date: Jul 2022 · Role: MTS-1 (off campus) · Result: Selected the same day
- Online test (90 minutes): two basic coding questions and 30 aptitude questions in three timed sections.
- Round 1: print a binary tree's boundary anticlockwise from the root (left edge, leaves, right edge, no repeats), explained and then coded; the interviewer wanted one traversal (Boundary of a Binary Tree, Anticlockwise).
- Round 2: the longest run of one letter after at most k changes; the fewest steps across a grid when up to k obstacles may be removed, moving right or down, then in all four directions.
- Manager round: a project, HR-style questions, networking, and moving a linked list's odd-position nodes ahead of the even ones.
H03: theory first, then three problems
Interview date: Jun 2022 · Role: MTS-1 (off campus) · Result: Not disclosed
- Round 1: DBMS indexing and isolation levels (answered in part); how the OS opens a file and the process control block; merge sort versus quicksort, where the candidate mixed up which is stable; SOLID, first confused with the OOP pillars.
- Then three problems: explain LeetCode 3 with a sliding window, no code (First and Last Longest Repeat-Free Substrings); change a tree so each node holds the sum of larger values, coded (Add All Larger Values in a BST); and the number of sign patterns that reach a target, coded with DP (Count Plus and Minus Sign Patterns).
- Round 2: deeper OS, networking and SOLID (indexing, paging, deadlock, scheduling, the OSI layers, HTTP versus HTTPS, thrashing); set matrix rows and columns to zero; LeetCode 868 (binary gap), then a bitwise version.
- Round 3: internship and project questions, authentication versus authorization, virtual functions, overloading versus overriding, socket programming and the OSI layers with their protocols; inorder traversal and the inorder predecessor with parent links; whether an increasing triplet exists, and how many non-decreasing ones.
H04: Jump Game II and a BST check
Report date: May 2022 · Role: MTS (on campus) · Result: Rejected
- Online test, which the candidate rated medium: the smallest angle between a clock's hour and minute hands; whether an array has indices i <= j < k with nums[i] * nums[j] = nums[k]; and 35 aptitude questions.
- Round 1: a project, then LeetCode 45 with a greedy answer and its cost (Fewest Jumps to the End or Stuck), and LeetCode 98 (Is This Binary Tree a BST), each with variations.
- Round 2, both solved with a little help: the cheapest way to connect every house to the internet, with the providers' prices in a 4 x 3 table and no house on the same provider as the one before it, and the top view of a binary tree.
- Manager round: blockchain, LeetCode 127 (Determine the Edit Distance in a Word Ladder), which the candidate only outlined, and LeetCode 155 (Stack With Constant-Time Minimum), solved fully.
H05: halving numbers below k
Interview date: May 2022 · Role: MTS (off-campus drive for recent graduates; 7 months at a first job) · Result: Offer
- Online test (90 minutes), which the candidate found not that hard: two coding problems and 30 aptitude, English and reasoning questions.
- Round 2 (about 50 minutes): given decimal numbers and k, halve any number in one move; what is the fewest moves until every number is at most k (Halve Values Until All Are at Most k); check whether a binary tree is a BST (Is This Binary Tree a BST); a project; and why leave your current company.
- Round 3: red-black versus AVL trees (balancing and insertion cost) and both kinds of polymorphism in code; copy a list with random pointers, then without a map; one more coding question the candidate did not recall.
- Manager round (about 40 minutes): experience, tech stack and a project; unique values in an array without changing it; a download manager design.
H06: groups of k and mirror trees
Report date: Apr 2022 · Role: MTS-1 (graduated 2021) · Location: India · Result: Rejected
- Round 1 (90 minutes): two easy-to-medium coding questions, plus 10 maths, 10 logic and 10 English questions.
- Round 2 (virtual, same day as round 3): reverse a linked list in groups of k in place, so a list of 1 to 8 with k = 3 ends as 3, 2, 1, 6, 5, 4 and then 8, 7 (Reverse a Linked List in Groups of k); are two trees mirror images (Are Two Binary Trees Mirror Images); semaphores, mutexes, processes and threads.
- Round 3: search a matrix sorted by rows and columns, then build a hash-map-like and a stack-like structure.
H07: islands and sorted squares
Interview date: Mar 2022 · Role: MTS 1 (off campus) · Result: Rejected
- Round 1 (60 minutes, with a CS-1 of four years who started easy and got harder): questions on the candidate's tech stack; pair up an array so every pair sum divides by k (Pair Up an Array So Every Pair Sum Divides by k); LeetCode 200 (Count the Islands); LeetCode 977 (Sorted Squares From an Ordered Array).
- Round 2 (60 minutes): LeetCode 3 and the k most frequent words. The rejection followed.
Keep practicing
- Search a Rotated Sorted Array: H01.
- Boundary of a Binary Tree, Anticlockwise: H02.
- First and Last Longest Repeat-Free Substrings: H03, H07.
- Add All Larger Values in a BST: H03.
- Count Plus and Minus Sign Patterns: H03.
- Fewest Jumps to the End or Stuck: H04.
- Is This Binary Tree a BST: H04, H05.
- Top View of a Binary Tree: H04.
- Determine the Edit Distance in a Word Ladder: H04.
- Stack With Constant-Time Minimum: H04.
- Halve Values Until All Are at Most k: H05.
- Why do you want to leave your current company?: behavioral question, H05.
- Reverse a Linked List in Groups of k: H06.
- Are Two Binary Trees Mirror Images: H06.
- Pair Up an Array So Every Pair Sum Divides by k: H07.
- Count the Islands: H07.
- Sorted Squares From an Ordered Array: H07.
- Adobe coding questions: all of Adobe's coding problems (sign-in needed).
- Adobe behavioral questions: Adobe's behavioral questions (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.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.