Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 12 :)
- Company
- Adobe
- Reports
- 4 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: 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 (current): Last frontend reports (66–67), release engineering (68), product consultant (69), and patterns across all 69
The last two frontend reports, two one-off roles, and the patterns across all 69 experienced-hire reports.
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 66–69 of 69: frontend engineers (Computer Scientist 1 and 2; 2025), one MTS-2 hire whose role turned out to be release engineering (Jul 2025), and one Associate Technical Product Consultant (Jan 2025), India where a place was given.
Other Adobe first-round roundups: interns · hiring level not reported
This part closes the frontend section, then has one release engineering report and one technical product consultant report. Patterns across all 69 reports, kept apart by role, come after the timelines.
Frontend engineers: what came up
These two reports split between data structures (linked lists, an LRU discussion and two array problems) and JavaScript problems on closures and prototypes.
| Topic | Reports | Most recent report |
|---|---|---|
| Linked lists | 1 of 2 | 2025 |
| LRU/LFU cache design | 1 of 2 | 2025 |
| Sorting and binary search | 1 of 2 | 2025 |
| Hash maps and counting | 1 of 2 | 2025 |
| Arrays and strings | 1 of 2 | 2025 |
| Resume and project deep dive | 1 of 2 | 2025 |
| JavaScript and TypeScript | 1 of 2 | 2025 |
Frontend engineers: questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Longest Run of Consecutive Values (LC 128) | 1 report | 2025 |
| Every Index Pair That Sums to a Target (two-sum variant, duplicates allowed) | 1 report | 2025 |
Frontend / UI Coding
| Question | Frequency | All last seen dates |
|---|---|---|
| Coding problem built on closures (task not shared) | 1 report | 2025 |
| Coding problem on the prototype chain (task not shared) | 1 report | 2025 |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| Linked-list use cases, an LRU cache discussion, choosing a sorting algorithm | 1 report | 2025 |
JavaScript core: closures, the event loop and this binding |
1 report | 2025 |
| Web security and frontend performance (topic only) | 1 report | 2025 |
Frontend engineers: 2 detailed candidate timelines
66: CS-2 frontend: linked lists, LRU talk and two array problems
Interview date: 2025 (report date Apr 21, 2025) · Role: Computer Scientist 2, frontend
Round 1: Data structures and algorithms (first technical round)
- The round leaned hard on time and space complexity.
- It opened with the resume and the candidate's performance work.
- Theory: where linked lists are useful, a long discussion of the LRU cache, and which sorting algorithm fits which case.
- Find the longest run of consecutive values in an array (LC 128).
- A two-sum variant: return every index pair that adds up to the target, with duplicate values allowed.
After round 1: Round 2 had Group Anagrams and Asteroid Collision. Round 3 covered the critical rendering path, React hooks and diffing, a prototype snippet, and a task runner that resolves promises in batches. Round 4 designed a file-directory UI. The candidate mentioned six rounds; only four were described, and no result was given.
67: CS-1 frontend, offered MTS-2: closure and prototype problems
Interview date: 2025 (report date Jun 30, 2025) · Role: Frontend engineer; interviewed for Computer Scientist 1, offered MTS-2 · Experience: 2 years 11 months · Location: India · Result: Offer at MTS-2
Round 1: JavaScript fundamentals and coding (first technical round)
- Questions on closures,
this,call/apply/bindand the event loop. - A coding problem built on closures. The exact task wasn't shared.
- A second problem about the prototype chain, also without details.
- Web security and frontend performance tuning.
- The round went well.
After round 1: Round 2 (45 minutes) was React machine coding: a custom pagination hook with a cursor and page size, plus infinite scroll that loads the next page at the bottom. Round 3 designed a config-driven app with a backend-for-frontend layer and caching, then a social feed page. The manager asked for search in a sorted 2D matrix, then replacing the found value while keeping the matrix sorted. The director asked for reversing a linked list in groups of k, in JavaScript. The offer came at MTS-2 instead of CS-1.
Release engineering: what came up
The one release engineering report had a stream median and an LRU cache in pseudo-code, plus questions on scaling, databases and OS basics.
Release engineering: questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Median of a Number Stream (LC 295) | 1 report | Reports: Jul 24, 2025 (report date); Additional FastPrep history: Aug 15, 2025 |
| Least Recently Used Cache With O(1) Calls (LC 146), pseudo-code only | 1 report | Reports: Jul 24, 2025 (report date); Additional FastPrep history: Jun 5, 2025 |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| Fundamentals: scaling, load balancers, CAP, DB locking, SQL vs NoSQL, normalization, OS locks | 1 report | Jul 24, 2025 (report date) |
Release engineering: 1 detailed candidate timeline
68: MTS-2 that turned out to be release engineering, median and LRU in pseudo-code
Report date: Jul 24, 2025 · Role: Applied for MTS-2; the role turned out to be release engineering · Result: Cleared three rounds, then declined before the director round
Round 1 (first technical round, about 70 minutes)
The round mixed DSA, system design, OOP and databases. The interviewer was friendly and gave time to think.
- Find the median of a stream of integers (LC 295). The candidate explained two heaps and how to rebalance them, with O(log n) inserts and an O(1) median. Only an explanation and pseudo-code were needed.
- A broad fundamentals talk: scaling, performance, concurrency, load balancers, the CAP theorem, database locking, SQL vs NoSQL and when to pick each, normalization, OS locks and atomicity.
- Implement an LRU cache (LC 146) in pseudo-code, using a hash map plus a doubly linked list.
The invite for round 2 came the same day.
After round 1: Round 2 had a long medium problem solved with backtracking, the friends-by-age request problem (LC 825), and questions on Jenkins, CI/CD, AWS, Kubernetes, Docker and Kafka from past work. The hiring manager round covered projects and ownership, plus finishing jobs on two single-task schedulers, with a follow-up for job dependencies. At some point the role turned out to be release engineering, and the candidate declined before the director round.
Technical product consultant: what came up
The one consultant report was a knowledge round on networking models, how APIs work, deadlocks and virtual memory.
Technical product consultant: questions we found
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| Networking: OSI and TCP/IP models; how an API works | 1 report | Jan 17, 2025 |
| OS: deadlock conditions; virtual memory | 1 report | Jan 17, 2025 |
Technical product consultant: 1 detailed candidate timeline
69: Associate Technical Product Consultant, networking and OS basics
Interview date: Jan 17, 2025 · Role: Associate Technical Product Consultant · Experience: 0 to 2 years · Location: India · Result: Rejected
Before the first technical round: An 80-minute online coding test in Oct 2024 with two problems: the left view of a binary tree and the longest common subsequence.
Round 2: Face to face (first live technical round, 50 minutes)
- Networking: the OSI model, the TCP/IP model and its layers, and how an API call works.
- Systems: what a deadlock is and the conditions it needs, and what virtual memory is.
The candidate was rejected after this round.
Patterns across the reports
Software engineers (reports 04–45)
-
Two or more coding problems in one round. 27 of the 42 reports had at least two coding problems in round 1, such as 25, 27, 32, 40 and 42. Some rounds had three or four (09, 14, 23, 24).
-
LRU and LFU caches. An LFU cache was coded in 05 and discussed in 23. 26 coded an LRU cache, then changed it so the eviction rule could be swapped.
-
A real coding environment. Round 1 ran on HackerRank in 05, 12 and 24, and 05's code had to pass custom test cases. 23 coded in their own IDE and ran custom inputs.
-
"Why this design, and how would it scale?" Two rounds asked the candidate to defend a past project's architecture and scaling (08, 11).
-
Design instead of coding. Round 1 was a design round for a Senior Computer Scientist (15, ticket booking) and a U.S. senior engineer (21, news feed). A CS-I round mixed DSA with a document-service design (14).
-
Pressure on the best answer. Interviewers pushed for the optimal solution or edge cases in 25, 31 and 38. In 31, the candidate thought both problems were done, but the feedback said one was unsolved and the other not optimized.
-
Fundamentals next to the coding. OS, DBMS, Java or C++ questions shared round 1 with coding in 30, 33, 36, 37, 40 and 44.
-
The same problem twice. Longest substring with at most k distinct characters (LC 340) came up in 10 and 12, and both solved it with a sliding window.
C++ engineers (reports 46–54)
-
Language questions in round 1. Eight of the nine C++ rounds asked about C++ itself. Only 49 was pure coding.
-
Smart pointers came up in 47, 50 and 54. Virtual functions, vtables or inheritance output came up in 46, 48, 53 and 54.
-
Concurrency. A producer-consumer queue (47), mutex ordering (51) and a thread-safe singleton (53).
Android engineers (55–57)
- Platform knowledge over puzzles. Two of three rounds were Android and Kotlin knowledge (55, 57); 56 was one packing problem.
Machine learning engineers (01–03)
- ML design in round 1. 01 designed a fraud-detection system and 03 a document aspect-ratio model. 02 talked projects and solved one quick coding problem.
Frontend engineers (58–67)
-
JavaScript fundamentals. Closures, the event loop,
thisand similar topics came up in 58, 59, 63, 64 and 67. -
DSA inside a frontend round. Classic coding problems sat next to JavaScript in 58, 59, 60, 64 and 66.
-
Layout tasks. 60 had a flexbox layout and 65 rebuilt a figure in HTML and CSS.
-
Interviewed for CS-1, offered MTS-2. This happened to two frontend candidates (63, 67).
Keep practicing
- Longest Run of Consecutive Values: practice problem from report 66.
- Every Index Pair That Sums to a Target: practice problem from report 66.
- Group Words by Their Letters: practice problem from report 66.
- Asteroid Collision: practice problem from report 66.
- Median of a Number Stream: practice problem from report 68.
- Least Recently Used Cache With O(1) Calls: practice problem from report 68.
- Adobe coding 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.