Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 9 :)
- Company
- Adobe
- Reports
- 5 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 (current): 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
Five C++ rounds from Aug back to Apr 2025; each one tested the language as well as problem solving.
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 50–54 of 69, C++ software engineers (MTS-2, Computer Scientist 1, SDE-2), India where a place was given, Aug–Apr 2025.
Other Adobe first-round roundups: interns · hiring level not reported
What came up
All five C++ rounds tested C++ internals. Two also touched concurrency, and two had an object design task: a thread-safe singleton and a logger class.
| Topic | Reports | Most recent report |
|---|---|---|
| C++ internals | 5 of 5 | Aug 26, 2025 |
| Heaps and priority queues | 1 of 5 | Aug 26, 2025 |
| Concurrency and threads | 2 of 5 | Jun 7, 2025 (report date) |
| Dynamic programming | 1 of 5 | Jun 7, 2025 (report date) |
| Bit tricks and math | 1 of 5 | Jun 7, 2025 (report date) |
| Sliding window and two pointers | 1 of 5 | Jun 2, 2025 (report date) |
| Hash maps and counting | 1 of 5 | Jun 2, 2025 (report date) |
| Low-level and object-oriented design | 2 of 5 | May 7, 2025 (report date) |
| Arrays and strings | 1 of 5 | May 7, 2025 (report date) |
| OS, DBMS and networking basics | 1 of 5 | May 7, 2025 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| The k Points Nearest the Origin (LC 973) | 1 report | Aug 26, 2025 |
| Stock Profit With One, Unlimited, or Two Trades (LC 121, 122, 123) | 1 report | Reports: Jun 7, 2025 (report date); Additional FastPrep history: Oct 31, 2025 |
| Most Cash From Non-Neighboring Houses (LC 198) | 1 report | Reports: Jun 7, 2025 (report date); Additional FastPrep history: Jun 10, 2026, Jul 10, 2025 |
| Most Cash Around a Circular Street (LC 213) | 1 report | Jun 7, 2025 (report date) |
| Find the Unpaired Numbers (LC 136, 260) | 1 report | Jun 7, 2025 (report date) |
| Rain Water Held Between Bars (LC 42) | 1 report | Reports: Jun 2, 2025 (report date); Additional FastPrep history: Aug 27, 2025 |
| Long-ID Store Without Hashing | 1 report | Reports: Jun 2, 2025 (report date); Additional FastPrep history: Aug 27, 2025 |
| Minimize the Largest Part Beauty | 1 report | May 7, 2025 (report date) |
Low-Level Design (LLD/OOD)
| Question | Frequency | All last seen dates |
|---|---|---|
| Implement a thread-safe Singleton in C++ and give a real use | 1 report | May 7, 2025 (report date) |
| Design a Configurable Logging Framework: a logger class, with code | 1 report | Apr 1, 2025 (report date) |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| C++ smart pointers: types and uses (topic only here: unique_ptr, shared_ptr, memory management, struct vs class, constructors) | 2 reports | Aug 26, 2025, Apr 1, 2025 (report date) |
| C++ mutexes: make two threaded functions print in a fixed order | 1 report | Jun 7, 2025 (report date) |
| Basic C++ fundamentals (topic only) | 1 report | Jun 2, 2025 (report date) |
| C++ containers: vector vs list vs queue, map vs unordered_map internals, vtables | 1 report | May 7, 2025 (report date) |
| OS: virtual memory, paging and segmentation | 1 report | May 7, 2025 (report date) |
| Explain several C++ snippets pasted in the editor | 1 report | May 7, 2025 (report date) |
| C++ virtual functions: vptr and vtable | 1 report | Apr 1, 2025 (report date) |
| How do you delete a copy constructor? | 1 report | Apr 1, 2025 (report date) |
| Function and operator overloading with code; static vs dynamic objects | 1 report | Apr 1, 2025 (report date) |
5 detailed candidate timelines, loops, and screens
50: 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.
51: 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.
52: 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.
53: 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.
54: 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.
Keep practicing
- The k Points Nearest the Origin: practice problem from report 50.
- Most Cash From Non-Neighboring Houses: practice problem from report 51.
- Most Cash Around a Circular Street: practice problem from report 51.
- Stock Profit With One, Unlimited, or Two Trades: practice problem from report 51.
- Find the Unpaired Numbers: practice problem from report 51.
- Trailing Zeros of n Factorial: practice problem from report 52.
- First Node Two Linked Lists Share: practice problem from report 52.
- Rain Water Held Between Bars: practice problem from report 52.
- Long-ID Store Without Hashing: practice problem from report 52.
- Minimize the Largest Part Beauty: practice problem from report 53.
- Mirror a Binary Tree: practice problem from report 54.
- Design a Configurable Logging Framework: design question from report 54.
- 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.