Adobe C++ Engineer Round 1: 9 Experiences (Part 8 of 12)
- Company
- Adobe
- Reports
- 9 interview reports
- Level
- Full-time
- Stages
- Phone screen
Adobe C++ engineer round 1 reports from 2025–2026 paired a coding problem with deep C++ questions on smart pointers, virtual functions and threads.
At a glance
- Process: one technical round of 45–60 minutes where given (43, 46, 51), usually one to three coding problems plus C++ and OS questions. Candidate 48's DSA only needed pseudo-code; 51 had to write code for every question. Later rounds went further into C++, design and a manager or director.
- Asked recently: smart pointers in 3 of 9 (44, 47, 51), virtual functions or inheritance in 4 (43, 45, 50, 51), threads and mutexes in 3 (44, 48, 50), and a design-a-class task in 3 (44, 50, 51). Coding ranged from Reverse a Singly Linked List to Shortest Window Covering All Letters.
- Difficulty: candidate 43 struggled most with two puzzles, 44 with a smart-pointer leak follow-up, and 46 found the interviewers a bit harsh after solving three problems in 45 minutes. One of the nine got an offer (49); 48 had positive feedback but the role was filled internally.
- Practise first: Design a Concurrent Multi-Producer Multi-Consumer Queue, Rain Water Held Between Bars, Long-ID Store Without Hashing and Design a Configurable Logging Framework.
Coverage: 9 C++ reports from Apr 2025 to Sep 2026: MTS and MTS-2 (43, 44, 46, 47, 49, including the Acrobat team), CS-1 (48 on the Illustrator team, 50), SDE-2 (51), and one with no title given (45). India where a place was given. The series covers 69 experienced-hire reports, first technical round only.
In this series
- Part 1: overview — the process, most-asked problems and a guide to every role
- Part 2: MTS-2, Jun 2025–Sep 2026 — 8 MTS-2 reports, entries 01–08
- Part 3: MTS-1 and MTS-2, Nov 2024–May 2025 — 7 more MTS reports, entries 09–15
- Part 4: Computer Scientist 1, Jul 2025–Aug 2026 — 8 CS-1 reports, entries 16–23
- Part 5: Computer Scientist 1, Dec 2024–Aug 2025 — 7 more CS-1 reports, entries 24–30
- Part 6: CS-2 and Senior Computer Scientist — 4 reports, entries 31–34
- Part 7: SDE, SE2 and senior engineers — 8 reports, entries 35–42
- Part 8 (current): C++ engineers
- Part 9: frontend engineers — 10 reports, entries 52–61
- Part 10: Android engineers — 3 reports, entries 62–64
- Part 11: machine learning engineers — 3 reports, entries 65–67
- Part 12: release engineering and product consultant — 2 reports, entries 68–69
What came up
C++ itself was tested as hard as the coding: smart pointers, virtual functions and threads each came up in at least three rounds.
| Topic | Reports | Last seen |
|---|---|---|
| Virtual functions and inheritance | 4 of 9 | Sep 2026 |
| Smart pointers | 3 of 9 | Aug 2026 (report date) |
| Threads and mutexes | 3 of 9 | Aug 2026 (report date) |
| Class design (queue, singleton, logger) | 3 of 9 | Aug 2026 (report date) |
| Strings and parsing | 2 of 9 | Sep 2026 |
| Arrays and two pointers | 2 of 9 | Sep 2025 (report date) |
| Debugging | 1 of 9 | Sep 2026 |
| Puzzles | 1 of 9 | Sep 2026 |
| Linked lists | 1 of 9 | before Jan 2026 |
| Heaps and geometry | 1 of 9 | Aug 2025 |
| Dynamic programming | 1 of 9 | Jun 2025 (report date) |
| Bit tricks | 1 of 9 | Jun 2025 (report date) |
| O(1) store without hashing | 1 of 9 | Jun 2025 (report date) |
| Binary search on the answer | 1 of 9 | May 2025 (report date) |
| OS memory | 1 of 9 | May 2025 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Evaluate a Parenthesized Integer Expression (LeetCode 224) | 1: 43 | Sep 2026 |
| Reverse a Singly Linked List (LeetCode 206) | 1: 45 | before Jan 2026 |
| Trailing Zeros of n Factorial (LeetCode 172) | 1: 46 | Sep 2025 (report date) |
| Merge Into the Zero-Padded Array (LeetCode 88) | 1: 46 | Sep 2025 (report date) |
| Shortest Window Covering All Letters (LeetCode 76) | 1: 46 | Sep 2025 (report date) |
| The k Points Nearest the Origin (LeetCode 973) | 1: 47 | Aug 2025 |
| Stock Profit With One, Unlimited, or Two Trades (LeetCode 121, 122, 123) | 1: 48 | Jun 2025 (report date) |
| Most Cash From Non-Neighboring Houses (LeetCode 198) | 1: 48 | Jun 2025 (report date) |
| Most Cash Around a Circular Street (LeetCode 213) | 1: 48 | Jun 2025 (report date) |
| Find the Unpaired Numbers (LeetCode 136, 260) | 1: 48 | Jun 2025 (report date) |
| Rain Water Held Between Bars (LeetCode 42) | 1: 49 | Jun 2025 (report date) |
| Long-ID Store Without Hashing | 1: 49 | Jun 2025 (report date) |
| Minimize the Largest Part Beauty | 1: 50 | May 2025 (report date) |
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Design a Concurrent Multi-Producer Multi-Consumer Queue | 1: 44 | Aug 2026 (report date) |
| Implement a thread-safe Singleton in C++ and give a real use | 1: 50 | May 2025 (report date) |
| Design a Configurable Logging Framework: a logger class, with code | 1: 51 | Apr 2025 (report date) |
Language and CS Fundamentals
| Question | Reports | Last seen |
|---|---|---|
| C++ snippets: spot the diamond-inheritance and virtual-constructor issues | 1: 43 | Sep 2026 |
| C++ smart pointers: types and uses (follow-up: a leak with smart pointers and how to fix it) | 1: 44 | Aug 2026 (report date) |
| Count calls to a const member function that can't change object state | 1: 44 | Aug 2026 (report date) |
| Multithreading; concurrency vs parallelism | 1: 44 | Aug 2026 (report date) |
| C++ Rule of Five and when it is needed | 1: 44 | Aug 2026 (report date) |
| C++ output questions on virtual functions and inheritance | 1: 45 | before Jan 2026 |
| C++ constructor and destructor behavior, including objects in a vector | 1: 45 | before Jan 2026 |
| C++ mutexes: make two threaded functions print in a fixed order | 1: 48 | Jun 2025 (report date) |
| C++ containers: vector vs list vs queue, map vs unordered_map internals, vtables | 1: 50 | May 2025 (report date) |
| OS: virtual memory, paging and segmentation | 1: 50 | May 2025 (report date) |
| Explain several C++ snippets pasted in the editor | 1: 50 | May 2025 (report date) |
| C++ virtual functions: vptr and vtable | 1: 51 | Apr 2025 (report date) |
| How do you delete a copy constructor? | 1: 51 | Apr 2025 (report date) |
| Function and operator overloading with code; static vs dynamic objects | 1: 51 | Apr 2025 (report date) |
Debugging
| Question | Reports | Last seen |
|---|---|---|
| How do you debug a segmentation fault? | 1: 43 | Sep 2026 |
Puzzles and Probability
| Question | Reports | Last seen |
|---|---|---|
| Puzzle: find 1 poisoned bottle among 1,000 with the fewest testers | 1: 43 | Sep 2026 |
| Puzzle: find the lighter ball among 8 in two weighings | 1: 43 | Sep 2026 |
9 C++ engineer round 1 reports
43: 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.
44: 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.
45: 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.
46: 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.
47: MTS-2 C++, closest points and pointer basics
Interview date: Aug 26, 2025 · Role: MTS-2 (C++) · Experience: 1 year 2 months · Result: No response after the round
Round 1 (first technical round)
- Coding: K closest points to the origin (LC 973).
- C++ knowledge: smart pointers, unique_ptr and shared_ptr, memory management, struct vs class, constructors and destructors. Only the topics were shared, not the exact questions.
The candidate felt it went well but heard nothing back.
After round 1: No later rounds were reported.
48: CS-1 on the Illustrator team, three classic problem families and mutexes
Report date: Jun 7, 2025 · Role: Computer Scientist 1 (C++, Illustrator team) · Experience: 4 years 10 months · Location: Bangalore, India · Result: Positive feedback in every round, but the role was filled internally
Round 1: Technical (first technical round)
The DSA part only needed pseudo-code, not running code.
- Stock profit with one, unlimited, or two trades: best time to buy and sell stock, then its second and third variations (LC 121, 122, 123).
- House Robber (LC 198), then House Robber on a circular street (LC 213).
- Find the unpaired numbers: Single Number and Single Number III (LC 136, 260). The candidate already knew the bit trick.
- C++ mutexes: given two functions running on different threads, use mutex locks so the output comes out in a fixed order.
Feedback after the round was positive.
After round 1: Round 2 covered unique_ptr and move semantics (fix a snippet's output), finding the cousins of a node in a binary tree in one pass, and an elevator design at the logic level. A techno-managerial round asked about projects, memory management, validating a BST, a singleton, and a class where every object, even a copy, gets a unique ID. A director round, which started about 50 minutes late, had a priests-and-devils river puzzle and a question on building an Illustrator feature. All feedback was positive, but the position was filled internally and the recruiter was looking for another team.
49: MTS-2 C++ in Noida, rain water and a no-hashing ID store
Report date: Jun 2, 2025 · Role: MTS-2 (C++) · Location: Noida, India · Result: Offer
Round 1 (first technical round, mostly DSA)
- Trapping rain water (LC 42).
- Keys are object IDs that are too long for any primitive type. Build a store with constant-time get, insert and delete, without unordered_map, because its worst case is O(n). See Long-ID store without hashing. The candidate first got stuck on unordered_map and talked through why it fails. They then proposed a trie, and the interviewer was happy with that.
- Some very basic C++ fundamentals.
After round 1: Round 2 asked about data types, where static and global variables live in memory, smart vs raw pointers, trailing zeroes of n!, a raw-pointer leak fixed with a smart pointer, and Coin Change (LC 322). The managerial round asked for the approach to where two linked lists meet, then a version with many lists that may merge, grouped in O(n) time, plus a general AI chat. The director round was a project deep dive and a design of the Acrobat desktop file system. The whole process took about a week, and the candidate was selected.
50: CS-1 C++, containers, a singleton and subarray beauty
Report date: May 7, 2025 · Role: Computer Scientist 1 (C++) · Experience: 3 years · Result: Rejected after round 2
Round 1 (first technical round)
- C++ containers: vector vs list vs queue, with use cases, internals and complexities. Then std::map vs unordered_map inside (red-black tree vs hash table), and how vtables make virtual functions work.
- Implement a thread-safe Singleton class in C++ and give a real use. The candidate used a logger as the example.
- Minimize the largest subarray beauty: split an array into k non-empty contiguous parts. A part's beauty is its largest element times its length. Return the smallest possible value of the largest beauty. The candidate explained an approach and coded it but couldn't get it working. The interviewer was still happy with the thinking.
- OS: virtual memory, paging and segmentation.
- Read several C++ snippets pasted into the editor and explain them.
The recruiter passed on positive feedback.
After round 1: Round 2 was with a very senior interviewer. It asked whether a unique_ptr and move-semantics snippet would compile and how to fix it, pass by value vs by reference, and finding all cousins of a given node in a binary tree. The candidate coded a two-pass BFS after discussing a one-pass idea, and was rejected after this round.
51: SDE-2 C++, a logger class and C++ internals
Report date: Apr 1, 2025 · Role: SDE-2 (C++) · Result: Rejected after the hiring manager round
Round 1: Technical interview (first technical round, 1 hour)
Code was expected for every question.
- Design a logger class and write the code.
- What is a virtual function? Explain vptr and vtable.
- What is unique_ptr?
- How do you stop a class from being copied? The candidate said you can make the copy constructor private or mark it as deleted.
- Function overloading and operator overloading, with code. Create objects both statically and dynamically.
The candidate passed this round.
After round 1: Round 2 (1 hour) covered C++ basics, the diamond problem, virtual functions, paging, mutexes and semaphores, then mirroring a binary tree (LC 226), whether an array can be split into two arrays each with unique frequencies, and KMP string matching. The 45-minute hiring manager round asked the candidate to rate their C++ and talk through the resume. They were rejected there, before the director round.
Patterns across the reports
- Smart pointers, in round one and again later. Three round-one interviews asked about them (44, 47, 51), and round two came back to them in 43, 49 and 50 (RAII, raw-pointer leaks, unique_ptr and move semantics).
- Write the class, not just the algorithm. Three rounds asked for a working class design: a producer-consumer queue (44), a thread-safe singleton (50) and a logger (51).
Common questions
What C++ questions does Adobe ask?
In these reports: smart pointer types and leaks (44, 47, 51), virtual functions and vtables (43, 45, 50, 51), the Rule of Five (44), stopping a class from being copied (51), map vs unordered_map internals (50) and constructor and destructor order with objects in a vector (45).
Does the Adobe C++ round include puzzles?
One of nine did: candidate 43 got a poisoned-bottle puzzle and a balance puzzle and felt those hurt them most.
Keep practicing
- Practice from these reports: evaluate an arithmetic expression string (43); thread-safe producer-consumer queue (44); reverse a linked list (45); Trailing zeroes of n! (46, 49); Merge B into A in place (46); Minimum window substring (46); K closest points to the origin (47); Stock profit with one, unlimited, or two trades (48); House Robber (48); House Robber on a circular street (48); Find the unpaired numbers (48); Trapping rain water (49); Long-ID store without hashing (49); where two linked lists meet (49); Minimize the largest subarray beauty (50); Design a logger class (51); mirroring a binary tree (51).
- Adobe coding bank: every Adobe algorithm problem in the question bank (sign-in needed).
- Adobe low-level design bank: the low-level design questions.
- Adobe overview: the Adobe interview page and Adobe hiring insights.
- More reports: the Experience feed.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.