Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 7 :)
- Company
- Adobe
- Reports
- 6 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: 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 (current): 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
Six rounds from 2025 back to Nov 2024, where hash maps did a lot of the work.
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 38–43 of 69, general software engineers (MTS-2, Computer Scientist 1 and 2), India where a place was given, 2025 and Dec–Nov 2024.
Other Adobe first-round roundups: interns · hiring level not reported
What came up
Hash maps came up in three of these six rounds. Two rounds added database or OS questions, and two had tree problems.
| Topic | Reports | Most recent report |
|---|---|---|
| Hash maps and counting | 3 of 6 | 2025 |
| Arrays and strings | 2 of 6 | 2025 |
| Sliding window and two pointers | 1 of 6 | 2025 |
| C++ internals | 1 of 6 | 2025 |
| OS, DBMS and networking basics | 2 of 6 | Dec 23, 2024 (report date) |
| Sorting and binary search | 1 of 6 | Dec 23, 2024 (report date) |
| Intervals | 1 of 6 | Dec 15, 2024 (report date) |
| Greedy | 1 of 6 | Dec 15, 2024 (report date) |
| Graphs (BFS/DFS) | 1 of 6 | Dec 15, 2024 (report date) |
| SQL and databases | 1 of 6 | Dec 15, 2024 (report date) |
| Trees | 2 of 6 | Dec 2024 |
| Dynamic programming | 1 of 6 | Dec 2024 |
| Behavioral questions | 1 of 6 | Dec 2024 |
| Streaming data | 1 of 6 | Nov 27, 2024 (report date) |
| Stacks and queues | 1 of 6 | Nov 27, 2024 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Rain Water Held Between Bars (a variation of LC 42) | 1 report | Reports: 2025; Additional FastPrep history: Jun 2, 2025 |
| Long-ID Store Without Hashing: O(1) Get, Add and Delete by ID | 1 report | Reports: 2025; Additional FastPrep history: Jun 2, 2025 |
| Search an Unbounded Sorted Array (LC 702 family) | 1 report | Dec 23, 2024 (report date) |
| Second coding problem, not remembered (topic only) | 1 report | Dec 23, 2024 (report date) |
| Minimum Arrows to Burst Balloons (LC 452) | 1 report | Dec 15, 2024 (report date) |
| Minutes Until All Oranges Rot (LC 994) | 1 report | Dec 15, 2024 (report date) |
| Unnamed DP problem to maximize an amount, without an n x n table (topic only) | 1 report | Dec 2024 |
| Zigzag Level Order of a Binary Tree (LC 103) | 1 report | Dec 2024 |
| Find the Pair With a Target Sum (LC 1) | 1 report | Dec 2024 |
| Mirror a Binary Tree (LC 226), recursive and iterative | 1 report | Dec 2024 |
| Earliest Unrepeated Letter in a Stream | 1 report | Nov 27, 2024 (report date) |
| Longest Zero Run Between Ones | 1 report | Nov 27, 2024 (report date) |
Behavioral (BQ)
| Question | Frequency | All last seen dates |
|---|---|---|
| Behavioral questions about current work, from the resume (exact prompts not shared) | 1 report | Dec 2024 |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| Database internals (topic only) | 1 report | Dec 23, 2024 (report date) |
| Databases: SQL vs NoSQL, indexing, sharding, locks, one app on two databases | 1 report | Dec 15, 2024 (report date) |
6 detailed candidate timelines, loops, and screens
38: CS-1 pressed on edge cases: trapped water and an O(1) ID store
Interview date: 2025 (report date Aug 27, 2025) · Role: Computer Scientist 1 · Result: Pending (the round 3 interviewer never showed up)
Round 1: DSA (first technical round)
- A variation of Trapping Rain Water (LC 42). The candidate went from brute force to the optimal answer in about 20 minutes, with a dry run.
- The interviewer wasn't satisfied and wanted explicit edge cases. They drilled into a C++ vector size check (v.size() <= 2 versus v.size() - 2 <= 0). The candidate added an explicit check when asked.
- Design three APIs that each run in O(1): Get(id), Add(id, name) and Delete(id). The candidate used hashing. The interviewer pushed back that collisions can make it O(n). Practice version: Long-ID Store Without Hashing.
- The candidate only moved on after chasing HR.
After round 1: Round 2 asked to reverse the words in a sentence while handling spaces, in O(n), and how to cut latency for a user in India reaching a time server in the USA. The round 3 interviewer did not show up.
39: 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.
40: Computer Scientist: balloons, rotting oranges, a database grilling
Report date: Dec 15, 2024 · Role: Computer Scientist (sub-level not given)
Round 1: DSA (first technical round)
- Coding happened in an IDE.
- Minimum Arrows to Burst Balloons (LC 452). It was new to the candidate. With steady hints they got close to the logic but were slow, so the interviewer moved on.
- Minutes until all oranges rot (LC 994). Solved quickly, explained, and run on the test cases the interviewer asked for.
- Databases: SQL vs NoSQL; why indexes exist, how they differ for read-heavy and write-heavy loads, and the data structure behind them; sharding and partitioning; locks and concurrency; and how one app talks to two databases.
After round 1: Round 2 had Majority Element, sorting 0s, 1s and 2s, and questions about Kafka use. Round 3, a design and hiring manager round, was the admin side of e-commerce inventory: add, remove and search products, APIs, sharding and hot keys. The outcome wasn't shared.
41: CS-1 with 4+ years: three ways through one DP, then zigzag
Interview date: Dec 2024 · Role: Computer Scientist 1 (Noida role; candidate based in Bengaluru) · Experience: 4+ years · Result: Not selected after the director round
Round 1: DSA (first technical round)
- A recruiter reached out. A Computer Scientist took this round.
- A DP problem about maximizing an amount. The candidate didn't recall the exact problem. They coded it three ways: recursion, then tabulation, then memoization. The interviewer asked them to avoid an n x n table and was happy with the approach.
- Zigzag level order of a binary tree (LC 103). The code had to work on the first run.
- The candidate rated it 9 out of 10, and the feedback was positive.
After round 1: An LLD round with a class diagram and partial code, and a 1.5-hour design round where database and queue choices had to be justified, both got positive feedback. The director round asked about the current company and about academics and marks. The candidate was not selected.
42: Applied for MTS-2, offered CS-1: Two Sum and a mirrored tree
Interview date: Dec 2024 (offer month; report date Dec 11, 2024) · Role: Applied for MTS-2, offered Computer Scientist 1 · Experience: 3.5 years · Location: Noida, India · Result: Offer at CS-1
Before the first technical round: The candidate applied through the careers site with a referral, then had a short recruiter call.
Round 1 (first technical round)
- Behavioral questions from the resume about the candidate's current work.
- Two Sum (LC 1): find two numbers in an array that add up to a target. The candidate had to pick the best approach on their own.
- Mirror a binary tree (LC 226) and print it, both recursively and iteratively.
After round 1: Round 2 was building a hashmap from scratch: hashing, collisions, load factor, rehashing, generics and optimizations. Round 3 asked for a stack with O(1) get, insert and delete for its middle element and a restaurant producer-consumer simulation with race conditions and autoscaling. The last round covered crashes, moving an event-driven system to APIs, querying trains through a station, and why Adobe. The offer came at CS-1, one level above the role applied for.
43: CS-2, one easy and one medium: stream characters and zero runs
Report date: Nov 27, 2024 · Role: Computer Scientist 2
First round (first technical round)
- A pure data structures and algorithms round with two problems, one easy and one medium.
- First non-repeating character in a stream: after each new character, output the first character so far that has appeared only once, or # if none. For x, x, y, z, y, z, w the output is x, #, y, y, z, #, w.
- Longest zero run between ones: find the longest run of zeros with a 1 on both sides. [1,0,0,1,0,0,0,1] gives 3. [0,0,0,0,1] and [1,0,0,0,0] both give 0, because those zeros touch an edge. [1,0,0,0,1,1,0,0,0,0,0,1] gives 5.
Only this round was described, and the result wasn't shared.
Keep practicing
- Rain Water Held Between Bars: practice problem from report 38.
- Long-ID Store Without Hashing: practice problem from report 38.
- Biggest Number From Gluing Numbers Together: practice problem from report 39.
- Search an Unbounded Sorted Array: practice problem from report 39.
- Minimum Arrows to Burst Balloons: practice problem from report 40.
- Minutes Until All Oranges Rot: practice problem from report 40.
- Value Filling Over Half of an Array: practice problem from report 40.
- Zigzag Level Order of a Binary Tree: practice problem from report 41.
- Find the Pair With a Target Sum: practice problem from report 42.
- Mirror a Binary Tree: practice problem from report 42.
- Earliest Unrepeated Letter in a Stream: practice problem from report 43.
- Longest Zero Run Between Ones: practice problem from report 43.
- 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.