Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 2 :)
- Company
- Adobe
- Reports
- 5 interview reports
- Level
- Full-time
- Stages
- Phone screen
In this series
- Part 1: Machine learning engineers (01–03), then software engineers from Sep–Aug 2026 (04–06)
- Part 2 (current): Software engineers, Aug–Jun 2026 (07–11)
- Part 3: Software engineers, May 2026–Nov 2025 (12–18)
- Part 4: Software engineers, Nov 2025–Jun 2025 (19–25)
- Part 5: Software engineers, Jun–Apr 2025 (26–31)
- Part 6: Software engineers, Apr–Feb 2025 plus year-only 2025 reports (32–37)
- Part 7: Software engineers, 2025 and Dec–Nov 2024 (38–43)
- Part 8: Last software engineers (44–45), then C++ engineers, Sep 2026–Sep 2025 (46–49)
- Part 9: C++ engineers, Aug–Apr 2025 (50–54)
- Part 10: Android engineers (55–57) and the newest frontend report (58)
- Part 11: Frontend engineers, May 2026–Apr 2025 (59–65)
- Part 12: Last frontend reports (66–67), release engineering (68), product consultant (69), and patterns across all 69
Five rounds from Aug back to Jun 2026, from a quick two-problem screen to a 90-minute resume grilling.
Coverage: Experienced hires at Adobe, first live technical round only (the first coding or technical interview after any online test or recruiter call). Later rounds get a short note at the end of each timeline. This part: reports 07–11 of 69, general software engineers (SDE, SDE 2, MTS-2, senior backend), India where a place was given, Aug–Jun 2026.
Other Adobe first-round roundups: interns · hiring level not reported
What came up
Trees came up in three of these five rounds, from merging two BSTs to listing root-to-leaf paths. Three rounds also had behavioral or project questions, and two of them asked why a project was built the way it was and how it would scale.
| Topic | Reports | Most recent report |
|---|---|---|
| Trees | 3 of 5 | Aug 2026 |
| Arrays and strings | 1 of 5 | Aug 2026 |
| Behavioral questions | 3 of 5 | Jul 28, 2026 (report date) |
| Resume and project deep dive | 2 of 5 | Jul 28, 2026 (report date) |
| System design | 1 of 5 | Jul 28, 2026 (report date) |
| Sorting and binary search | 1 of 5 | Jul 28, 2026 (report date) |
| Bit tricks and math | 1 of 5 | Jun 10, 2026 (report date) |
| Dynamic programming | 1 of 5 | Jun 10, 2026 (report date) |
| Backtracking and recursion | 1 of 5 | Jun 10, 2026 (report date) |
| Streaming data | 1 of 5 | Jun 10, 2026 (report date) |
| Hash maps and counting | 2 of 5 | Jun 6, 2026 |
| Sliding window and two pointers | 1 of 5 | Jun 6, 2026 |
Questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Rotate an Array In Place (LC 189) | 1 report | Reports: Aug 2026; Additional FastPrep history: Apr 24, 2025 |
| All Elements of Two BSTs in Order (LC 1305) | 1 report | Aug 2026 |
| Sort 1 billion numbers that don't fit in memory (external sort) | 1 report | Jul 28, 2026 (report date) |
| The One Repeated Number (duplicate in a stream) | 1 report | Jun 10, 2026 (report date) |
| Most Cash From Non-Neighboring Houses (LC 198) | 1 report | Reports: Jun 10, 2026 (report date); Additional FastPrep history: Jul 10, 2025, Jun 7, 2025 |
| All Safe Boards for N Queens (LC 51) | 1 report | Jun 10, 2026 (report date) |
| Longest Stretch With At Most K Different Letters (LC 340) | 1 report | Reports: Jun 6, 2026; Additional FastPrep history: May 21, 2026 |
| Root-to-Leaf Paths as Strings (LC 257) | 1 report | Jun 6, 2026 |
| Search Autocomplete With Top Suggestions (LC 642) | 1 report | Jun 6, 2026 (report date) |
Behavioral (BQ)
| Question | Frequency | All last seen dates |
|---|---|---|
| Justify each resume project: design choices, trade-offs, and how it would scale (practice) | 2 reports | Jul 28, 2026 (report date), Jun 6, 2026 (report date) |
| How did you handle retries and rate limits for background jobs calling busy APIs? (practice) | 1 report | Jun 6, 2026 |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| Where Kafka, RabbitMQ and Redis fit in a distributed system | 1 report | Jul 28, 2026 (report date) |
5 detailed candidate timelines, loops, and screens
07: SDE backend: rotate array and two BSTs, then selected
Interview date: Aug 2026 · Role: SDE (backend developer) · Result: Selected
Before the first technical round: A 60–90 minute online test with aptitude and 20 technical multiple-choice questions (DSA, OS, DBMS, SQL), with no interviewer.
Round 2: DSA coding (first technical round)
- 60 minutes, two problems: one on arrays, one on trees.
- Rotate an array to the right by k steps (LC 189). Example: [1..7] with k = 3 becomes [5,6,7,1,2,3,4]. The candidate started with brute force, O(n·k). When the interviewer asked for something faster, they used an extra array in O(n), then the reverse trick with O(1) extra space. They handled k larger than n with k % n. Follow-up: does it still work when k = 0?
- Return all values from two binary search trees as one sorted list (LC 1305). The candidate did an inorder traversal of each tree and merged the two lists.
They passed.
After round 1: Round 3 mixed a short coding problem the candidate didn't remember with questions on hobbies and keeping up with tech. Round 4 was Kth smallest element in a sorted matrix (min-heap first, then binary search on values). Round 5 was behavioral, and the candidate was selected.
08: MTS-2 Java/Spring Boot: a 90-minute resume grilling
Report date: Jul 28, 2026 · Role: Member of Technical Staff 2 (Java, Spring Boot) · Result: Rejected after round 1
Round 1 (first technical round, in person)
- The round took about 90 minutes. All rounds had been scheduled for the same day. The candidate came from a C++ background, and the interviewer seemed to be checking whether that would carry over to Java and Spring Boot.
- Most of the time went to the resume. The candidate had to justify almost every bullet: how each project would scale, design choices and trade-offs, an old internship project, and the architecture of personal projects. One project's high-level design was drawn out (practice).
- Where Kafka, RabbitMQ and Redis each fit in a distributed system.
- Sort 1 billion numbers that don't fit in memory. The candidate worked toward external sorting and reached the expected answer.
They were rejected after this round.
09: SDE 2 on Zoom: XOR duplicate, House Robber, N-Queens
Report date: Jun 10, 2026 · Role: SDE 2 · Result: Not selected
Before the first technical round: An online test with two easy-to-medium DSA questions the candidate didn't remember.
Round 2: Live DSA on Zoom (first technical round)
- Three questions, easy to hard. Code went into a shared document. It had to compile, but no test cases were run.
- A stream of integers has exactly one value that appears twice; return it. The candidate went through several ideas and landed on XOR. The interviewer pressed on XOR properties and didn't seem convinced.
- House Robber (LC 198). Recursion first, then memoized DP. The candidate dry-ran test cases and showed the DP table values.
- N-Queens (LC 51). Backtracking, but the code wasn't finished in time. The interviewer was vague about what the function should return and wasn't happy with the code.
The candidate was not selected.
10: Senior backend (Python, Gen AI) on Adobe Express: two clean coding problems
Interview date: Jun 6, 2026 · Role: Senior Backend Engineer (Python / Gen AI), Adobe Express · Experience: about 5 years · Location: Noida, India · Result: Waiting on feedback
Round 1: Core programming and problem solving (first technical round)
- One hour on Microsoft Teams with a senior engineer. The tone was warm and chatty. Rounds ran back to back.
- Given a string s and an integer k, return the length of the longest substring with at most k distinct characters (LC 340). The candidate used a sliding window with a frequency map, O(n) time and O(k) space, and traced it on an example. The interviewer was happy.
- Return every root-to-leaf path of a binary tree as a string like "1->2->5" (LC 257). DFS first. Follow-ups: write it iteratively (a stack of node and path pairs), go deep on complexity, and handle a very deep tree that would hit the recursion limit.
- Experience with high-throughput APIs: how retries and rate limits were handled in background jobs (practice). The candidate described exponential backoff with Celery.
After round 1: Round 2 was a notification service LLD (email, SMS, push, user preferences, per-channel rate limits, then WhatsApp), a knowledge graph for content tags, and design-pattern questions. Round 3 was a RAG document Q&A platform plus Gen AI questions. Two more rounds were still to be scheduled.
11: MTS-2 offer in Noida: autocomplete with top suggestions
Report date: Jun 6, 2026 · Role: MTS-2 · Experience: close to 3 years · Location: Noida, India · Result: Offer
Round 1: DSA + project deep dive (first technical round, virtual)
- A recruiter reached out first. The round was held online.
- Build search autocomplete like a video site's search box (LC 642): match on a prefix, keep a count for each query, and return the top suggestions. The candidate used a trie that stores frequencies and top suggestions. Follow-ups: millions of queries, better ranking, lower latency, and scaling.
- A project deep dive: why the current architecture, what the trade-offs were, how it behaves at scale, and what they would improve (practice).
They passed.
After round 1: Round 2 was a rate limiter LLD and a file upload system taken from LLD to HLD. Rounds 3 (hiring manager) and 4 (director) were face to face, with AI internals, a no-library DSA problem, project architecture and failure cases. The candidate got the offer.
Keep practicing
- All Elements of Two BSTs in Order: practice problem from report 07.
- Rotate an Array In Place: practice problem from report 07.
- For a project on your resume, why did you choose its architecture, what were the trade-offs, and how would you scale it further?: behavioral question from reports 08, 11.
- The One Repeated Number: practice problem from report 09.
- Most Cash From Non-Neighboring Houses: practice problem from report 09.
- All Safe Boards for N Queens: practice problem from report 09.
- Longest Stretch With At Most K Different Letters: practice problem from report 10.
- Root-to-Leaf Paths as Strings: practice problem from report 10.
- Your background jobs call a busy external API. Walk me through how you deal with failed calls and request limits.: behavioral question from report 10.
- Search Autocomplete With Top Suggestions: practice problem from report 11.
- Adobe coding questions: the company-filtered question bank (sign-in needed).
- Adobe behavioral questions: the company-filtered question bank (sign-in needed).
- Adobe interview guide: Adobe's interview overview page on FastPrep.
- Adobe hiring insights: hiring activity and trends for Adobe.
- Experience feed: more interview experiences and roundups.
Other Adobe first-round roundups: interns · hiring level not reported
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.