Adobe SDE and Senior SWE Round 1: 8 Experiences (Part 7 of 12)
- Company
- Adobe
- Reports
- 8 interview reports
- Level
- Full-time
- Stages
- Phone screen
Adobe SDE and senior software engineer round 1 reports from 2025–2026 mostly show two to three coding problems, often after an online test.
At a glance
- Process: an online test came first for 35 (aptitude and multiple choice) and 36 (two DSA problems); the live round then had two or three problems. Candidate 41 had two rounds on one day, and 37's ran back to back. The one U.S. senior engineer had a design talk and then a homework assignment (39).
- Asked recently: heaps and streams in 2 of 8 (40, 42), trees in 2 (35, 37), DP in 2 (36, 41), and intervals in 1 (38). Candidate 41 also had C++ questions on static variables, delete[] and smart pointers.
- Difficulty: candidate 36 called theirs easy to hard and ran out of time on N-Queens; 37's interviewer was warm and pushed on complexity and deep trees. One of the eight was selected (35).
- Practise first: Rotate an Array In Place, Longest Stretch With At Most K Different Letters, Median of a Number Stream and Insert and Merge an Interval.
Coverage: 8 reports from Mar 2025 to Aug 2026: SDE and SDE 2 (35, 36, 41), Software Engineer 2 (40), SDE-4 (42), a senior backend engineer on Adobe Express (37), a U.S. senior software engineer (39), and one candidate whose title wasn't stated (38). India where a place was given, except 39. 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 (current): SDE, SE2 and senior engineers
- Part 8: C++ engineers — 9 reports, entries 43–51
- 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
The coding spread across many topics, with no single problem named twice. Where an online test came first, the live round still had at least two problems.
| Topic | Reports | Last seen |
|---|---|---|
| Trees | 2 of 8 | Aug 2026 |
| Dynamic programming | 2 of 8 | Jun 2026 (report date) |
| Heaps and streams | 2 of 8 | Aug 2025 |
| Arrays | 1 of 8 | Aug 2026 |
| Bit tricks | 1 of 8 | Jun 2026 (report date) |
| Backtracking | 1 of 8 | Jun 2026 (report date) |
| Sliding window | 1 of 8 | Jun 2026 |
| Behavioral (API reliability) | 1 of 8 | Jun 2026 |
| Intervals | 1 of 8 | Jan 2026 |
| Interface design | 1 of 8 | Jan 2026 |
| System design | 1 of 8 | Sep 2025 |
| Hash maps and prefix sums | 1 of 8 | Mar 2025 |
| C++ fundamentals | 1 of 8 | Mar 2025 |
| Two pointers | 1 of 8 | Mar 2025 |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Rotate an Array In Place (LeetCode 189) | 1: 35 | Aug 2026 |
| All Elements of Two BSTs in Order (LeetCode 1305) | 1: 35 | Aug 2026 |
| The One Repeated Number (duplicate in a stream) | 1: 36 | Jun 2026 (report date) |
| Most Cash From Non-Neighboring Houses (LeetCode 198) | 1: 36 | Jun 2026 (report date) |
| All Safe Boards for N Queens (LeetCode 51) | 1: 36 | Jun 2026 (report date) |
| Longest Stretch With At Most K Different Letters (LeetCode 340) | 1: 37 | Jun 2026 |
| Root-to-Leaf Paths as Strings (LeetCode 257) | 1: 37 | Jun 2026 |
| Insert and Merge an Interval (LeetCode 57) | 1: 38 | Jan 2026 |
| Next Upcoming Birthday (interface over name, parents, birth date) | 1: 38 | Jan 2026 |
| Median of a Number Stream (LeetCode 295) | 1: 40 | Aug 2025 |
| Merge Several Sorted Arrays | 1: 40 | Aug 2025 |
| Count Subarrays That Add Up to k (LeetCode 560) | 1: 41 | Mar 2025 |
| Match a Pattern With ? and * (LeetCode 44) | 1: 41 | Mar 2025 |
| Distinct Triplets That Sum to Zero (LeetCode 15) | 1: 42 | Mar 2025 |
| Combine the Two Smallest Until All Reach k (similar to LC 3066) | 1: 42 | Mar 2025 |
System Design
| Question | Reports | Last seen |
|---|---|---|
| Design a Following News Feed Service (very low latency) | 1: 39 | Sep 2025 |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| How did you handle retries and rate limits for background jobs calling busy APIs? (practice) | 1: 37 | Jun 2026 |
Language and CS Fundamentals
| Question | Reports | Last seen |
|---|---|---|
| C++: static variables, how delete[] works, smart pointers | 1: 41 | Mar 2025 |
8 SDE and senior engineer round 1 reports
35: SDE backend: rotate array and two BSTs, then selected
Interview date: Aug 2026 · Role: SDE (backend developer) · Result: Selected
Before the first technical round: A 60–90 minute online test with aptitude and 20 technical multiple-choice questions (DSA, OS, DBMS, SQL), with no interviewer.
Round 2: DSA coding (first technical round)
- 60 minutes, two problems: one on arrays, one on trees.
- Rotate an array to the right by k steps (LC 189). Example: [1..7] with k = 3 becomes [5,6,7,1,2,3,4]. The candidate started with brute force, O(n·k). When the interviewer asked for something faster, they used an extra array in O(n), then the reverse trick with O(1) extra space. They handled k larger than n with k % n. Follow-up: does it still work when k = 0?
- Return all values from two binary search trees as one sorted list (LC 1305). The candidate did an inorder traversal of each tree and merged the two lists.
They passed.
After round 1: Round 3 mixed a short coding problem the candidate didn't remember with questions on hobbies and keeping up with tech. Round 4 was Kth smallest element in a sorted matrix (min-heap first, then binary search on values). Round 5 was behavioral, and the candidate was selected.
36: SDE 2 on Zoom: XOR duplicate, House Robber, N-Queens
Report date: Jun 10, 2026 · Role: SDE 2 · Result: Not selected
Before the first technical round: An online test with two easy-to-medium DSA questions the candidate didn't remember.
Round 2: Live DSA on Zoom (first technical round)
- Three questions, easy to hard. Code went into a shared document. It had to compile, but no test cases were run.
- A stream of integers has exactly one value that appears twice; return it. The candidate went through several ideas and landed on XOR. The interviewer pressed on XOR properties and didn't seem convinced.
- House Robber (LC 198). Recursion first, then memoized DP. The candidate dry-ran test cases and showed the DP table values.
- N-Queens (LC 51). Backtracking, but the code wasn't finished in time. The interviewer was vague about what the function should return and wasn't happy with the code.
The candidate was not selected.
37: Senior backend (Python, Gen AI) on Adobe Express: two clean coding problems
Interview date: Jun 6, 2026 · Role: Senior Backend Engineer (Python / Gen AI), Adobe Express · Experience: about 5 years · Location: Noida, India · Result: Waiting on feedback
Round 1: Core programming and problem solving (first technical round)
- One hour on Microsoft Teams with a senior engineer. The tone was warm and chatty. Rounds ran back to back.
- Given a string s and an integer k, return the length of the longest substring with at most k distinct characters (LC 340). The candidate used a sliding window with a frequency map, O(n) time and O(k) space, and traced it on an example. The interviewer was happy.
- Return every root-to-leaf path of a binary tree as a string like "1->2->5" (LC 257). DFS first. Follow-ups: write it iteratively (a stack of node and path pairs), go deep on complexity, and handle a very deep tree that would hit the recursion limit.
- Experience with high-throughput APIs: how retries and rate limits were handled in background jobs (practice). The candidate described exponential backoff with Celery.
After round 1: Round 2 was a notification service LLD (email, SMS, push, user preferences, per-channel rate limits, then WhatsApp), a knowledge graph for content tags, and design-pattern questions. Round 3 was a RAG document Q&A platform plus Gen AI questions. Two more rounds were still to be scheduled.
38: Second attempt in Noida: insert interval and the next birthday
Interview date: Jan 2026 · Role: Not stated · Location: Noida, India
Round 1 (first technical round)
- Insert an interval (LC 57).
- Design an interface that returns the next upcoming birthday. The data holds each person's name, parents and birth date.
After round 1: Round 2 was a logger system design (async logging, file vs console). Round 3 was a rate limiter, scaled from a small system to millions of users. The outcome wasn't shared.
This was the candidate's second Adobe attempt; their first attempt was a separate application.
39: Senior SWE in the U.S.: one fast news feed design
Interview date: Sep 10, 2025 · Role: Senior Software Engineer · Location: United States · Result: No offer
Initial interview (first and only live round)
- Design a distributed news feed that has to be very fast.
- It was a talk through different architectures and approaches. The candidate was told they did well.
After round 1: A homework assignment followed. No further interview came, and they were rejected.
40: Software Engineer 2 in India: stream median and k sorted arrays
Interview date: Aug 15, 2025 · Role: Software Engineer 2 · Location: India · Result: No offer
Round 1 (first technical round)
- Find the median of a stream of integers (LC 295).
- Given n sorted integer arrays, merge them into one sorted array.
After round 1: Round 2 asked the candidate to design a shared pointer in C++, traverse a tree in one thread while printing values from another, and design a memory manager that makes as few system calls as possible. There was no offer.
41: 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.
42: 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.
Common questions
Does Adobe give SDE candidates an online test first?
Two of the eight had one: 35's was 60–90 minutes of aptitude and 20 multiple-choice questions on DSA, OS, DBMS and SQL, and 36's had two easy-to-medium DSA problems.
How many coding problems are in the Adobe SDE first round?
Two in most reports (35, 37, 38, 40, 41, 42) and three in 36. Candidate 39's round was a single design discussion.
Must the code run in the Adobe SDE round?
It depended. Candidate 36's code had to compile in a shared document but wasn't run on tests; 35 and 37 walked through faster versions and dry runs at the interviewer's request.
Keep practicing
- Practice from these reports: Rotate an array to the right by k steps (35); all values from two binary search trees as one sorted list (35); A stream of integers has exactly one value that appears twice; return it (36); House Robber (36); N-Queens (36); longest substring with at most k distinct characters (37); every root-to-leaf path of a binary tree as a string (37); Insert an interval (38); next upcoming birthday (38); Design a distributed news feed (39); median of a stream of integers (40); merge them into one sorted array (40); Count Subarrays With Sum K (41); Wildcard pattern matching (41); Unique triplets summing to zero (42); Minimum Combine Operations to Reach a Threshold (42).
- Behavioral prompts from these reports: practice (37).
- Adobe coding bank: every Adobe algorithm problem in the question bank (sign-in needed).
- Adobe system design bank: the system design questions.
- Adobe behavioral bank: the behavioral 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.