Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 6 :)
- 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 (current): 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: Last frontend reports (66–67), release engineering (68), product consultant (69), and patterns across all 69
Six rounds from spring 2025, including three candidates with seven or more years of experience.
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 32–37 of 69, general software engineers (Computer Scientist 1 and 2, MTS-2, SDE2, SDE-4), India where a place was given, Apr–Feb 2025 plus reports dated only to 2025.
Other Adobe first-round roundups: interns · hiring level not reported
What came up
Array and string problems led again, in three of six rounds, with sliding-window or two-pointer ideas in two. Two rounds opened with C++ questions before the coding.
| Topic | Reports | Most recent report |
|---|---|---|
| Arrays and strings | 3 of 6 | about Apr 2025 |
| Sliding window and two pointers | 2 of 6 | about Apr 2025 |
| Backtracking and recursion | 1 of 6 | about Apr 2025 |
| C++ internals | 2 of 6 | Mar 6, 2025 |
| Hash maps and counting | 2 of 6 | Mar 6, 2025 |
| Dynamic programming | 2 of 6 | Mar 6, 2025 |
| Sorting and binary search | 1 of 6 | Mar 2025 |
| Trees | 1 of 6 | Feb 27, 2025 (report date) |
| Graphs (BFS/DFS) | 1 of 6 | Feb 27, 2025 (report date) |
| Intervals | 1 of 6 | 2025 |
| OS, DBMS and networking basics | 1 of 6 | 2025 |
Questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Depth-Weighted Sum of a Nested List (LC 339) | 1 report | about Apr 2025 |
| Palindrome After At Most One Deletion (LC 680) | 1 report | about Apr 2025 |
| Count Subarrays That Add Up to k (LC 560) | 1 report | Mar 6, 2025 |
| Match a Pattern With ? and * (LC 44) | 1 report | Mar 6, 2025 |
| Distinct Triplets That Sum to Zero (LC 15) | 1 report | Mar 2025 |
| Combine the Two Smallest Until All Reach k (similar to LC 3066) | 1 report | Mar 2025 |
| Everyone Under a Manager | 1 report | Feb 27, 2025 (report date) |
| Most Cash From Non-Neighboring Houses (LC 198) | 1 report | Reports: 2025; Additional FastPrep history: Jun 10, 2026, Jun 7, 2025 |
| Strict Text to Integer for a Given Size | 1 report | 2025 |
| Merge Overlapping Intervals (a variation of LC 56) | 1 report | 2025 |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| C++: static variables, how delete[] works, smart pointers | 1 report | Mar 6, 2025 |
| Easy C++ input/output question (topic only) | 1 report | Mar 6, 2025 |
| C++: pointer vs reference, stack overflow without recursion, heap memory | 1 report | 2025 |
| Threads vs processes, memory paging, database indexing, REST basics | 1 report | 2025 |
6 detailed candidate timelines, loops, and screens
32: CS-2 from big tech, seven years in: two warm-up coding problems
Interview date: about Apr 2025 (offer in Apr 2025) · Role: Computer Scientist 2 · Experience: 7 years · Location: Noida, India · Result: Offer
Round 1: Coding (first technical round)
- The process started with a referral and a recruiter call.
- Nested list depth-weighted sum (LC 339): a nested list of integers; add up each integer times its depth. [[1,1],2,[1,1]] gives 10, and [1,[4,[6]]] gives 27.
- Palindrome after at most one deletion (LC 680).
After round 1: Round 2 was LLD for chess, with classes, fields and method signatures. The hiring manager round covered a key project, C++ pointer output and debugging snippets, then string compression and version-number comparison with full runnable code. The director round asked behavioral questions and a working C++ LRU cache built from a real-world scenario. The recruiter confirmed the next day that the candidate had cleared.
33: SDE2 in Bengaluru: C++ basics, subarray sums and wildcards
Interview date: Mar 6, 2025 · Role: Software Engineer II (SDE2) · Location: Bengaluru, India · Result: No offer
Round 1: First technical round
- The candidate applied online with no referral. Two technical rounds ran on the same day.
- After an intro came C++ concepts: static variables, how delete[] works, and smart pointers.
- Count Subarrays With Sum K (LC 560).
- Wildcard pattern matching (LC 44).
- An easy C++ question about predicting input and output. It wasn't described further.
- The candidate qualified.
After round 1: Round 2 repeated the C++ topics and added one problem: something like a most-recently-used queue that returns the sum of the k most recent elements. The hiring manager round on March 10 asked for a BST built from a stream with CRUD and a proven time bound, a deep smart-pointer question, and M producers with N consumers that take the middle element. The candidate was rejected there.
34: SDE-4 with 8.5 years: 3Sum and a threshold problem
Interview date: Mar 2025 · Role: SDE-4 (Adobe title not given) · Experience: 8.5 years · Location: Bangalore, India · Result: Rejected at the hiring manager round
Round 1: DS/Algo (first technical round)
- Unique triplets summing to zero, the classic 3Sum (LC 15).
- A second problem that the candidate compared to LC 3066, about the fewest operations needed to push values past a threshold. The exact changes weren't described. Closest practice: Minimum Combine Operations to Reach a Threshold.
After round 1: Round 2 was a broad talk on Java, OOP, Spring, multithreading, databases, architecture and SOLID. The design round asked for CRUD APIs on a multi-tenant course table and a system that builds monthly statements for millions of users. The hiring manager round covered past work, monitoring, debugging and the hardest problem solved, and ended in a rejection.
35: MTS-2: everyone under a manager, then trees vs graphs
Report date: Feb 27, 2025 · Role: MTS-2 · Result: Rejected
Round 1: Problem solving and data structures (first technical round)
- All employees under a manager: a table of employee name, manager name and salary. Return every employee who reports to a given manager, directly or through others.
- The candidate used BFS over the hierarchy.
- Follow-ups: should this be a tree or a graph, what is the real difference, what do both cost, and when would you pick each.
- The candidate answered all of them and felt the round went well.
After round 1: Round 2 was LLD: a past project, then an elevator you call from outside by picking a floor, starting with the database. A manager round went deep on experience. The director, camera off, asked for a secret vault design with encryption (symmetric vs asymmetric) and microservice resilience, plus LCA in an n-ary tree, which the candidate solved with root-to-node paths. The result was a rejection.
36: CS-1 with a late start: C++ memory basics, house robber, strict atoi
Interview date: 2025 (report date Jul 10, 2025) · Role: Computer Scientist 1 · Location: Noida, India · Result: Rejected after round 2, no feedback
Round 1: DSA and C++ fundamentals (first technical round)
- The interviewer joined an hour late.
- C++ questions: pointer vs reference, what a stack overflow is and whether it can happen without recursion, and what heap memory is.
- House Robber (LC 198). The candidate solved it, moving from brute force to memoization to O(1) space.
- Strict string to integer: skip leading and trailing spaces. The input is valid only if it is all digits, with an optional leading minus. Return INT_MAX on overflow or bad input. You can't assume the integer is 2 or 4 bytes.
- Both were solved. At the end, the interviewer asked the candidate to show their Chrome search history.
- The candidate passed.
After round 1: Round 2 was rescheduled four times. It asked for count of smaller numbers after self and container with most water. The candidate used two pointers for the second, but the interviewer pushed for a stack-based answer. A rejection followed with no feedback.
37: CS-2 backend, about eight years in: an intervals warm-up
Interview date: 2025 (report date Jul 14, 2025) · Role: Computer Scientist II (backend) · Experience: about 8 years · Location: Noida, India · Result: Offer
Before the first technical round: A HackerRank test with two medium problems (a sliding window and a graph traversal) and an LRU cache to implement.
Round 2: Live coding and CS fundamentals (first technical round)
- A friendly warm-up before the design rounds.
- A variation of merging overlapping intervals (LC 56). The exact twist wasn't shared. The candidate talked through the approach and edge cases and refined it with the interviewer.
- Fundamentals: threads vs processes, memory paging, database indexing and REST basics.
After round 1: Round 3 was LLD of a notification system for email, SMS and push. Round 4 was a design for scalable file storage, a light Dropbox. The hiring manager round covered projects, production issues and mentoring. An offer followed.
Keep practicing
- Depth-Weighted Sum of a Nested List: practice problem from report 32.
- Palindrome After At Most One Deletion: practice problem from report 32.
- Count Subarrays That Add Up to k: practice problem from report 33.
- Match a Pattern With ? and *: practice problem from report 33.
- Distinct Triplets That Sum to Zero: practice problem from report 34.
- Combine the Two Smallest Until All Reach k: practice problem from report 34.
- Everyone Under a Manager: practice problem from report 35.
- Most Cash From Non-Neighboring Houses: practice problem from report 36.
- Strict Text to Integer for a Given Size: practice problem from report 36.
- Merge Overlapping Intervals: practice problem from report 37.
- 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.