Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 8 :)
- 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: Software engineers, 2025 and Dec–Nov 2024 (38–43)
- Part 8 (current): 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
The last two general software engineering reports, then the first four C++ rounds, where language questions sat next to the coding.
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 44–45 (MTS-2 Java, Nov 2024 to mid-2025) and 46–49 (C++ software engineers, MTS and MTS-2, India where a place was given, Sep 2026–Sep 2025) of 69.
Other Adobe first-round roundups: interns · hiring level not reported
This part has two role sections: the end of the general software engineering section, then the start of the C++ section, which continues in Part 9.
Software engineers: what came up
Both rounds opened with a deep dive into past projects. Only one shared a full coding task: two adjacent increasing subarrays, then the largest length that works.
| Topic | Reports | Most recent report |
|---|---|---|
| Resume and project deep dive | 2 of 2 | Nov 2024–May 2025 |
| OS, DBMS and networking basics | 1 of 2 | Nov 2024–May 2025 |
| Java | 1 of 2 | Nov 2024–May 2025 |
| Concurrency and threads | 1 of 2 | Nov 2024–May 2025 |
| Hash maps and counting | 1 of 2 | Nov 2024–May 2025 |
| Arrays and strings | 1 of 2 | Nov 2024 |
| Sorting and binary search | 1 of 2 | Nov 2024 |
Software engineers: questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Print an element chosen by frequency with Java Streams (rule not given) | 1 report | Nov 2024–May 2025 |
| Two Non-Overlapping Increasing Blocks (LC 3349, then LC 3350 for the largest k) | 1 report | Nov 2024 |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| OS question, core Java and thread pools (topic only) | 1 report | Nov 2024–May 2025 |
Software engineers: 2 detailed candidate timelines
44: MTS-2 Java on a first job switch: out after round 1
Interview date: between Nov 22, 2024 and May 21, 2025 (exact date not given) · Role: MTS-2 (Java) · Result: Eliminated in round 1
Round 1: CS fundamentals, Java and coding (first technical round)
- This was the candidate's first job switch.
- About 30 minutes went to a deep dive on a project. Which project, and the exact questions, weren't shared.
- Then an operating systems question, core Java and thread pools. The specific questions weren't listed.
- A short coding task: print an element picked by its frequency, using Java Streams. The frequency rule, input and output weren't given.
- The candidate was eliminated after this round.
45: MTS-2 Java: two increasing subarrays, then the largest k
Interview date: Nov 2024 · Role: MTS-2 (Java) · Experience: 2+ years · Location: Noida, India · Result: Not selected
Round 1: Problem solving (first technical round)
- This was the candidate's first Adobe interview. It opened with an intro and questions on their company projects.
- Two non-overlapping increasing subarrays: decide whether the array has two adjacent, non-overlapping, strictly increasing subarrays of length k (LC 3349).
- Follow-up on the same setup: find the largest k for which two such subarrays exist (LC 3350).
After round 1: Round 2 was problem solving in Java: concurrency, race conditions and the reader-writer problem, a concurrent hashmap with get, put and delete, and lock/unlock on a tree with parent pointers, where a node can be locked only if no ancestor or descendant is locked. The candidate was not selected.
C++ software engineers: what came up
Three of these four C++ rounds asked about C++ internals, such as virtual functions, smart pointers and the rule of five. The fourth was pure coding, with three problems in 45 minutes.
| Topic | Reports | Most recent report |
|---|---|---|
| C++ internals | 3 of 4 | Sep 2026 |
| Stacks and queues | 1 of 4 | Sep 2026 |
| Debugging | 1 of 4 | Sep 2026 |
| Puzzles and probability | 1 of 4 | Sep 2026 |
| Concurrency and threads | 1 of 4 | Aug 10, 2026 (report date) |
| Low-level and object-oriented design | 1 of 4 | Aug 10, 2026 (report date) |
| Linked lists | 1 of 4 | before Jan 2026 |
| Bit tricks and math | 1 of 4 | Sep 7, 2025 (report date) |
| Sliding window and two pointers | 1 of 4 | Sep 7, 2025 (report date) |
| Resume and project deep dive | 1 of 4 | Sep 7, 2025 (report date) |
C++ software engineers: questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Evaluate a Parenthesized Integer Expression (LC 224) | 1 report | Sep 2026 |
| Reverse a Singly Linked List (LC 206) | 1 report | before Jan 2026 |
| Trailing Zeros of n Factorial (LC 172) | 1 report | Sep 7, 2025 (report date) |
| Merge Into the Zero-Padded Array (LC 88) | 1 report | Sep 7, 2025 (report date) |
| Shortest Window Covering All Letters (LC 76) | 1 report | Sep 7, 2025 (report date) |
Low-Level Design (LLD/OOD)
| Question | Frequency | All last seen dates |
|---|---|---|
| Design a Concurrent Multi-Producer Multi-Consumer Queue | 1 report | Aug 10, 2026 (report date) |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| C++ snippets: spot the diamond-inheritance and virtual-constructor issues | 1 report | Sep 2026 |
| C++ smart pointers: types and uses (follow-up: a leak with smart pointers and how to fix it) | 1 report | Aug 10, 2026 (report date) |
| Count calls to a const member function that can't change object state | 1 report | Aug 10, 2026 (report date) |
| Multithreading; concurrency vs parallelism | 1 report | Aug 10, 2026 (report date) |
| C++ Rule of Five and when it is needed | 1 report | Aug 10, 2026 (report date) |
| C++ output questions on virtual functions and inheritance | 1 report | before Jan 2026 |
| C++ constructor and destructor behavior, including objects in a vector | 1 report | before Jan 2026 |
Debugging
| Question | Frequency | All last seen dates |
|---|---|---|
| How do you debug a segmentation fault? | 1 report | Sep 2026 |
Puzzles and Probability
| Question | Frequency | All last seen dates |
|---|---|---|
| Puzzle: find 1 poisoned bottle among 1,000 with the fewest testers | 1 report | Sep 2026 |
| Puzzle: find the lighter ball among 8 in two weighings | 1 report | Sep 2026 |
C++ software engineers: 4 detailed candidate timelines
46: MTS C++ screen with a calculator problem and two puzzles
Interview date: Sep 2026 · Role: MTS, C++ software engineer · Experience: 3 years 3 months · Location: India · Result: Rejected
Round 1: DSA, C++ and puzzles (first technical round, 60 minutes)
- Coding: evaluate an arithmetic expression string (LC 224). The candidate hadn't seen it before and finished in about 30 minutes.
- C++ code reading: find the problem in two snippets. One was the diamond problem from multiple inheritance. The other was about a "virtual constructor" in a parent and child class. They answered both.
- How would you debug a segmentation fault? They answered.
- Puzzle: one bottle out of 1,000 is poisoned. Find it with the fewest testers within a time limit.
- Puzzle: 8 balls look the same, but one is lighter. Find it with exactly two weighings on a balance.
The candidate couldn't solve either puzzle within the limits and felt the puzzles hurt them most.
After round 1: Round 2 (60 minutes) covered C++ concepts such as smart pointers and RAII, a Singleton in C++, and a low-level design for smart pointers. The candidate didn't finish the smart-pointer design well and was rejected after that round.
47: MTS-2 C++, smart pointers and a producer-consumer queue
Report date: Aug 10, 2026 · Role: MTS-2 (C++) · Experience: 3 years · Result: Pending when reported
Round 1: Core C++ and multithreading (first technical round)
After a short intro, the interviewer moved straight into C++ and threads.
- Smart pointers: what they are, the types, and when to use each. Follow-up: show a memory leak that still happens with smart pointers, then explain how to find and fix it. The core question went fine; the leak follow-up was the hard part.
- A const member function can't change the object's state. How do you count how many times it is called anyway?
- What is multithreading? How is concurrency different from parallelism?
- Design a thread-safe producer-consumer queue. Follow-up: all consumers are already waiting and no producer thread has started yet. What happens? This led into condition variables and synchronization.
- Explain the Rule of Five in C++ and when you need it.
Overall the candidate was happy with the round, except for that smart-pointer follow-up.
After round 1: Round 2 was DSA: sort an array of 0s, 1s and 2s without a general sort, reverse a stack recursively with no extra structure, a shortest path in a grid, and a simple reference-counted shared_ptr. Round 3 was design: a thread-safe message queue (including what the destructor does while threads are blocked) and a simplified word processor with styles, images and undo/redo, plus debugging a memory leak and a locking bug. An HR round followed; the final result wasn't known yet.
48: C++ lateral interview with a linked-list warm-up (first attempt)
Interview date: before Jan 2026 (first attempt; exact date not given) · Role: Not stated (C++ interviews) · Result: No offer this time
Technical interview (the only round reported for this attempt)
- Coding: reverse a linked list (LC 206).
- Output questions on C++ virtual functions and inheritance: read the code and say what it prints.
- Constructor and destructor behavior, and what changes when objects are stored in a vector.
After this round: No further Adobe rounds were reported for this attempt. The same candidate applied again and interviewed in Jan 2026.
49: MTS-2 on the Acrobat team, three problems in 45 minutes
Report date: Sep 7, 2025 · Role: MTS-2, C++ developer (Acrobat team) · Experience: 2 years · Result: Not reported
Before the first technical round: An HR call set up the interview.
Round 1 (first technical round, 45 minutes for three problems)
- A short intro and a few questions about past projects.
- Trailing zeroes of n! (LC 172). Solved.
- Array A holds sorted values followed by m zeros. Array B holds m sorted values. Merge B into A in place so A ends fully sorted (LC 88). The candidate used three pointers and solved it.
- Minimum window substring (LC 76). Solved.
The candidate solved all three but ran about 5 minutes over. They found the interviewers a bit harsh. Because of the overrun, an extra round was added.
After round 1: The extra round asked a variant of merging intervals on a 2D plane with more twists. The candidate said they couldn't understand what was being asked.
Keep practicing
- Two Non-Overlapping Increasing Blocks: practice problem from report 45.
- Evaluate a Parenthesized Integer Expression: practice problem from report 46.
- Design a Concurrent Multi-Producer Multi-Consumer Queue: design question from report 47.
- Reverse a Singly Linked List: practice problem from report 48.
- Trailing Zeros of n Factorial: practice problem from report 49.
- Merge Into the Zero-Padded Array: practice problem from report 49.
- Shortest Window Covering All Letters: practice problem from report 49.
- Adobe coding questions: the company-filtered question bank (sign-in needed).
- Adobe low-level 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.