Adobe Interviews, Level Unknown: 38 Experiences (Part 1 of 3)
- Company
- Adobe
- Level
- Unknown
- Stages
- Phone screen
Of 38 Adobe reports with no hiring level, the 20 recent ones show 14 single technical interviews, mixing classic coding tasks with theory questions.
At a glance
- Process: 14 of 20 reports describe one technical interview, sometimes after an online test (SE 09, SE 10, FE 04) or a 15-minute call (OPS 01), and ML 01 a research talk followed by a coding round. Five had more rounds (SE 02, SE 05, SE 06, QA 01, QA 02), up to seven for QA 02.
- Asked in these reports: strings and linked lists each in 3 of 11 software engineer reports (SE 01, SE 02, SE 09; SE 03, SE 07, SE 10), with list reversal named twice (SE 03, SE 10); web or React theory in 4 of 5 frontend reports (FE 01, FE 02, FE 04, FE 05).
- Difficulty: ratings split. SE 08 and SE 11 called the coding easy to easy-medium and QA 01 its palindrome easy; SE 09's test problems and ML 01's interview problem were medium; SE 10 found its online test very hard, and SE 06 called its four test questions very large.
- Practise first: Reverse a Singly Linked List, Is the String a Palindrome and Boundary of a Binary Tree, Anticlockwise.
Coverage: 38 Adobe candidates whose reports do not say whether they were interns, new grads or experienced hires: software engineers (25), frontend and web (6), quality (3), DevOps (2) and machine learning (2), in India, Romania, France, Armenia and the United States. The tables cover the 20 current reports (Nov 2023 to Oct 2024; SE 05's interview fell between Jul 2024 and Mar 2025); the other 18 (2022 to 2023) are in each part's History. They stay apart from the cohort articles: experienced hires · interns · new grads. Reports from Nov 2024 on have their own roundups: experienced hires · interns · level not reported.
In this series
- Part 1 (current): overview and question tables
- Part 2: software engineers
- Part 3: frontend, web, quality, DevOps and ML roles
What came up
Counts are per role. Software engineers (11 current reports):
| Topic | Reports | Last seen |
|---|---|---|
| Strings | 3 of 11 | Sep 2024 |
| Linked lists | 3 of 11 | Aug 2024 |
| Language theory (C++) | 2 of 11 | Aug 2024 (report date) |
| Trees | 2 of 11 | Aug 2024 |
| Arrays | 1 of 11 | Mar 2025 (report date) |
| Board checks | 1 of 11 | Mar 2025 (report date) |
| Memory copy | 1 of 11 | Mar 2025 (report date) |
| API design | 1 of 11 | Mar 2025 (report date) |
| Heaps | 1 of 11 | Aug 2024 (report date) |
| Backtracking | 1 of 11 | Aug 2024 (report date) |
| Design patterns | 1 of 11 | Jul 2024 |
| Digit maths | 1 of 11 | Apr 2024 |
Strings: SE 01, SE 02, SE 09. Linked lists: SE 03, SE 07, SE 10. C++ theory: SE 02, SE 10. Trees: SE 04, SE 11. Frontend and web developers (5) mostly met web or React theory (FE 01, FE 02, FE 04, FE 05). Both quality engineers opened with two string or array tasks (QA 01, QA 02). The DevOps (OPS 01) and ML (ML 01) reports are single cases.
Questions we found
The Reports column names the entries. Each role has its own tables.
Software engineers: coding
| Question | Reports | Last seen |
|---|---|---|
| Reverse a Singly Linked List | 2: SE 03, SE 10 | Aug 2024 |
| Length of a down-then-up stretch | 1: SE 05 | Mar 2025 (report date) |
| Is This Tic-Tac-Toe Board Reachable | 1: SE 05 | Mar 2025 (report date) |
| Write memcpy | 1: SE 05 | Mar 2025 (report date) |
| Reverse a String | 1: SE 01 | Sep 2024 |
| A structure that keeps returning and updating its minimum | 1: SE 02 | Aug 2024 (report date) |
| Merge two linked lists (Merge Two Sorted Linked Lists) | 1: SE 03 | Aug 2024 |
| Boundary of a Binary Tree, Anticlockwise | 1: SE 04 | Aug 2024 |
| Fastest search in a circular list | 1: SE 07 | May 2024 |
| Add Digits Until One Remains | 1: SE 08 | Apr 2024 |
| Turn integers into strings | 1: SE 09 | Feb 2024 (report date) |
| All Cousins of a Tree Node | 1: SE 11 | Nov 2023 |
Software engineers: design
| Question | Reports | Last seen |
|---|---|---|
| An API that keeps k players' scores and returns the lowest | 1: SE 05 | Mar 2025 (report date) |
Software engineers: concepts
| Question | Reports | Last seen |
|---|---|---|
| What is wrong with a given function (const, references, names) | 1: SE 02 | Aug 2024 (report date) |
| Class versus struct | 1: SE 02 | Aug 2024 (report date) |
| Patterns used in system design | 1: SE 06 | Jul 2024 |
Frontend and web developers: coding
| Question | Reports | Last seen |
|---|---|---|
| Build a Queue From Two Stacks | 1: FE 02 | May 2024 |
| Is the String a Palindrome, with a stack | 1: FE 05 | Nov 2023 |
Frontend and web developers: concepts
| Question | Reports | Last seen |
|---|---|---|
| Lazy loading | 1: FE 01 | Oct 2024 |
| JavaScript performance | 1: FE 01 | Oct 2024 |
| The CSS box model | 1: FE 01 | Oct 2024 |
| Semantic HTML | 1: FE 01 | Oct 2024 |
| JavaScript primitives | 1: FE 01 | Oct 2024 |
| Calling APIs from React | 1: FE 02 | May 2024 |
| Linear versus non-linear data structures | 1: FE 03 | Jan 2024 |
| Which HTTP method for posting a comment | 1: FE 04 | Dec 2023 |
Frontend and web developers: behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| How would you improve your project (practice) | 1: FE 03 | Jan 2024 |
Quality engineers: coding
| Question | Reports | Last seen |
|---|---|---|
| Move the Ones Before the Zeros | 1: QA 01 | Mar 2024 |
| Is the String a Palindrome | 1: QA 01 | Mar 2024 |
| An array's minimum and maximum | 1: QA 01 | Mar 2024 |
| An array's most repeated value | 1: QA 01 | Mar 2024 |
| Weave two arrays into a third | 1: QA 01 | Mar 2024 |
| Most and Least Frequent Characters | 1: QA 02 | Nov 2023 |
| Every Index Pair That Sums to a Target | 1: QA 02 | Nov 2023 |
| Move negative numbers to the left | 1: QA 02 | Nov 2023 |
| Remove all vowels | 1: QA 02 | Nov 2023 |
Quality engineers: testing
| Question | Reports | Last seen |
|---|---|---|
| Test plan for creating a group chat | 1: QA 02 | Nov 2023 |
| Test plan for a big sale day | 1: QA 02 | Nov 2023 |
| Testing a new microservice | 1: QA 02 | Nov 2023 |
Quality engineers: low-level design
| Question | Reports | Last seen |
|---|---|---|
| A printer in SOLID classes | 1: QA 02 | Nov 2023 |
DevOps engineers: system design
| Question | Reports | Last seen |
|---|---|---|
| Design a Web App With Password Login | 1: OPS 01 | Sep 2024 |
ML engineers: research questions
| Question | Reports | Last seen |
|---|---|---|
| Which model you used (research Q&A) | 1: ML 01 | Apr 2024 |
Common questions
How long are these Adobe interviews?
Few reports say: 30 to 45 minutes (SE 04), a 40-minute technical interview (OPS 01), 45 minutes (SE 09), and a 90-minute supervised session of seven problems (SE 08).
Do Adobe frontend interviews include coding?
Two of the five current frontend reports named a coding task in the interview (FE 02, FE 05), and FE 04 also had an online coding challenge first. FE 01 and FE 03 described only theory and project questions.
How did these candidates do?
Three of 20 got offers (SE 11, FE 02, QA 02), two did not say (SE 05, SE 09), and 15 got no offer.
What to practise
- Reverse a Singly Linked List. Named by 2 of 11 current software engineer reports (SE 03, SE 10), most recently Aug 2024.
- Is the String a Palindrome. Named once in the frontend group (FE 05) and once in the quality group (QA 01).
- Boundary of a Binary Tree, Anticlockwise. One of two tree tasks among the software engineers (SE 04; the other is SE 11).
Keep practicing
- Part 2: software engineers: its practice problems, each with the entry that named it.
- Part 3: frontend, web, quality, DevOps and ML roles: its practice problems, each with the entry that named it.
- Adobe coding questions: all of Adobe's coding problems (sign-in needed).
- Adobe behavioral questions: Adobe's behavioral questions (sign-in needed).
- Adobe system design questions: Adobe's system design cases (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.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.