Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 4 :)
- Company
- Adobe
- Reports
- 7 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: Software engineers, Aug–Jun 2026 (07–11)
- Part 3: Software engineers, May 2026–Nov 2025 (12–18)
- Part 4 (current): 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
Seven rounds from Nov 2025 back to Jun 2025, including the only U.S. report in this role.
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 19–25 of 69, general software engineers (MTS-2, Computer Scientist 1, Software Engineer 2, one Senior Software Engineer in the U.S.), India elsewhere where a place was given, Nov 2025–Jun 2025.
Other Adobe first-round roundups: interns · hiring level not reported
What came up
Trees came up in three of these seven rounds, and heaps, greedy choices and dynamic programming in two each. The senior U.S. round skipped coding and asked for a news feed design.
| Topic | Reports | Most recent report |
|---|---|---|
| Heaps and priority queues | 2 of 7 | Nov 15, 2025 (report date) |
| Greedy | 2 of 7 | Nov 15, 2025 (report date) |
| Dynamic programming | 2 of 7 | Nov 15, 2025 (report date) |
| Trees | 3 of 7 | Nov 2025 |
| System design | 1 of 7 | Sep 10, 2025 |
| Streaming data | 1 of 7 | Aug 15, 2025 |
| Sorting and binary search | 1 of 7 | Aug 15, 2025 |
| Sliding window and two pointers | 1 of 7 | Jul 18, 2025 (report date) |
| LRU/LFU cache design | 1 of 7 | Jul 18, 2025 (report date) |
| Resume and project deep dive | 1 of 7 | Jul 5, 2025 (report date) |
| Concurrency and threads | 1 of 7 | Jul 5, 2025 (report date) |
| Java | 1 of 7 | Jul 5, 2025 (report date) |
| Arrays and strings | 1 of 7 | Jun 9, 2025 (report date) |
| Hash maps and counting | 1 of 7 | Jun 9, 2025 (report date) |
| Graphs (BFS/DFS) | 1 of 7 | Jun 9, 2025 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Minimum Sum After K Ceiling Halvings (LC 1962 family) | 1 report | Nov 15, 2025 (report date) |
| 0/1 Knapsack: Best Value Within a Weight Limit (with an unreported twist) | 1 report | Nov 15, 2025 (report date) |
| Message Broadcast Time in an Org Tree (parallel, then one child at a time) | 1 report | Nov 2025 |
| Median of a Number Stream (LC 295) | 1 report | Reports: Aug 15, 2025; Additional FastPrep history: Jul 24, 2025 |
| Merge Several Sorted Arrays | 1 report | Aug 15, 2025 |
| Unnamed medium sliding-window problem (topic only) | 1 report | Jul 18, 2025 (report date) |
| Unnamed medium binary-tree problem (topic only) | 1 report | Jul 18, 2025 (report date) |
| Unnamed hard binary-tree problem, approach only (topic only) | 1 report | Jul 18, 2025 (report date) |
| Least Frequently Used Cache Simulator (LC 460) | 1 report | Jul 18, 2025 (report date) |
| Unnamed medium problem, working code (topic only) | 1 report | Jul 5, 2025 (report date) |
| Cheapest Order to Cut a Rod (LC 1547) | 1 report | Jul 5, 2025 (report date) |
| Rebuild a Binary Tree From Two Walks (LC 105) | 1 report | Jul 5, 2025 (report date) |
| Second unnamed medium problem (topic only) | 1 report | Jul 5, 2025 (report date) |
| Value Filling Over Half of an Array (LC 169) | 1 report | Jun 9, 2025 (report date) |
| Count Pairs of Nodes That Cannot Reach Each Other (LC 2316) | 1 report | Jun 9, 2025 (report date) |
System Design
| Question | Frequency | All last seen dates |
|---|---|---|
| Design a Following News Feed Service (very low latency) | 1 report | Sep 10, 2025 |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| How to handle concurrency in Java | 1 report | Jul 5, 2025 (report date) |
7 detailed candidate timelines, loops, and screens
19: MTS-2 by referral: K halvings with a heap, then a knapsack twist
Report date: Nov 15, 2025 · Role: MTS-2 · Result: Rejected
Round 1: DSA (first technical round)
- The candidate came in through a friend's referral and a recruiter call.
- Minimize an array's sum after exactly K operations, where each operation takes one element, divides it by 2 rounding up, and puts it back. They used a max-heap: O(N log N) time, O(N) space.
- A knapsack problem with a small twist. The twist wasn't described. They solved it with 2D DP and then optimized it.
After round 1: Rounds 2 and 3 were both LLD: a configuration management service, then search autocomplete ranked by frequency with a trie, and Linux directory commands (mkdir, ls, delete) in Java, where only one function got finished. They were rejected.
20: MTS-2: one org tree, two ways to pass a message
Interview date: Nov 2025 · Role: MTS-2 · Result: Rejected after the hiring manager round
Round 1: DSA (first technical round)
- An org tree with the CEO at the root. A message goes from each parent to all its children at once. Find the minimum time for the message to reach every employee.
- Same tree, new rule: a parent tells its children one at a time (first child at t = 1, second at t = 2, and so on). Find the minimum time again.
- The candidate coded both parts, and the interviewer looked satisfied.
After round 1: Round 2 was an in-memory file system (ls, mkdir, addFile, getFile) with a follow-up on changing the file content type using Java generics; they coded a working version. Round 3, a warehouse system LLD (renting space to firms, allocation, orders), didn't go well. After a 40-minute hiring manager round, they were rejected.
21: Senior SWE in the U.S.: one fast news feed design
Interview date: Sep 10, 2025 · Role: Senior Software Engineer · Location: United States · Result: No offer
Initial interview (first and only live round)
- Design a distributed news feed that has to be very fast.
- It was a talk through different architectures and approaches. The candidate was told they did well.
After round 1: A homework assignment followed. No further interview came, and they were rejected.
22: Software Engineer 2 in India: stream median and k sorted arrays
Interview date: Aug 15, 2025 · Role: Software Engineer 2 · Location: India · Result: No offer
Round 1 (first technical round)
- Find the median of a stream of integers (LC 295).
- Given n sorted integer arrays, merge them into one sorted array.
After round 1: Round 2 asked the candidate to design a shared pointer in C++, traverse a tree in one thread while printing values from another, and design a memory manager that makes as few system calls as possible. There was no offer.
23: CS-1 drive: three unnamed problems in an hour, plus LFU talk
Report date: Jul 18, 2025 · Role: Computer Scientist 1 · Experience: 4.5 years · Result: Rejected after the director round
Round 1: DSA (first technical round, virtual hiring drive)
- One hour. The candidate coded in their own IDE and ran custom inputs.
- A medium sliding-window problem and a medium binary-tree problem. Neither was named. Both were solved within 30 minutes.
- A hard binary-tree problem, approach only. Not named either.
- A discussion of an LFU cache (LC 460).
The feedback was positive; the candidate rated it a strong hire.
After round 1: Round 2 on HackerRank had a balanced-parentheses variant (all tests passed), a Goodreads design with schemas, and multithreading scenarios. Round 3 (hiring manager) was projects and behavioral. The director round asked how they review a PR or design doc and about RabbitMQ internals. They were rejected.
24: CS-1 Java offer: stick cutting swapped for tree building
Report date: Jul 5, 2025 · Role: Computer Scientist 1 (Java) · Result: Offer, accepted
Round 1: DSA (first technical round)
- On HackerRank. It opened with an intro and questions on resume projects.
- A medium problem (not named). The candidate wrote working, optimal code with edge cases.
- Minimum cost to cut a stick (LC 1547). They spotted it as a standard DP problem, so the interviewer switched to another question.
- Build a binary tree from its preorder and inorder traversals (LC 105). Approach only; no code asked.
- Another medium problem (not named). They explained the approach, but the code wasn't done in time.
- How to handle concurrency in Java.
They passed.
After round 1: Two design rounds followed: a train ticket booking LLD (search, seats, routes, re-booking freed seats, schema and SQL), then a checkout flow with auth on the APIs. The managerial round included scheduling a meeting when the most users are free. After the director round, the candidate got and accepted the offer.
25: MTS-2 Java, cut after a two-problem elimination round
Report date: Jun 9, 2025 · Role: MTS-2 (Java) · Experience: 3 years · Result: Rejected after round 1
Round 1: DSA (first technical round)
- This was a virtual elimination round. Two more rounds were planned for the same day, but only for people who cleared it.
- The interviewer wanted the most optimal time and space, and code that actually ran and passed test cases.
- First problem: Majority Element (LC 169), find the value that appears more than half the time.
- Second problem: Count Unreachable Pairs of Nodes in an undirected graph (LC 2316), count the node pairs with no path between them.
After round 1: The candidate was rejected here, so the later rounds never happened.
Keep practicing
- Search Autocomplete With Top Suggestions: practice problem from report 19.
- Minimum Sum After K Ceiling Halvings: practice problem from report 19.
- 0/1 Knapsack: Best Value Within a Weight Limit: practice problem from report 19.
- Message Broadcast Time in an Org Tree: practice problem from report 20.
- Design a Following News Feed Service: design question from report 21.
- Median of a Number Stream: practice problem from report 22.
- Merge Several Sorted Arrays: practice problem from report 22.
- Least Frequently Used Cache Simulator: practice problem from report 23.
- Cheapest Order to Cut a Rod: practice problem from report 24.
- Rebuild a Binary Tree From Two Walks: practice problem from report 24.
- Value Filling Over Half of an Array: practice problem from report 25.
- Count Pairs of Nodes That Cannot Reach Each Other: practice problem from report 25.
- Adobe coding questions: the company-filtered question bank (sign-in needed).
- Adobe system design 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.