Adobe CS-2 and Senior CS Round 1: 4 Experiences (Part 6 of 12)
- Company
- Adobe
- Reports
- 4 interview reports
- Level
- Full-time
- Stages
- Phone screen
Adobe CS-2 and senior Computer Scientist round 1 reports from 2024–2026 describe warm-up coding for CS-2 and a full system design for senior CS.
At a glance
- Process: for the three CS-2s, round one was two short coding problems (32, 34) or one, plus fundamentals (33, after a HackerRank test). The senior CS started with a high-level design instead (31). Later rounds were LLD, a design round, a hiring manager and a director.
- Asked: Depth-Weighted Sum of a Nested List and Palindrome After At Most One Deletion (32), an intervals variant (33), a stream problem and a zero-run problem (34), and a BookMyShow-style booking design (31).
- Difficulty: candidate 32 called the problems warm-ups, 33 a friendly warm-up, and 34 one easy and one medium. Both CS-2s who reported a result got offers (32, 33); the senior CS was rejected after a DSA round.
- Practise first: Merge Overlapping Intervals, Earliest Unrepeated Letter in a Stream and Longest Zero Run Between Ones.
Coverage: 4 reports from Nov 2024 to Feb 2026: three Computer Scientist 2 (backend in 33; Noida in 32 and 33) and one Senior Computer Scientist. The series covers 69 experienced-hire reports, first technical round only; later rounds get a short note at the end of each entry.
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 (current): CS-2 and Senior Computer Scientist
- Part 7: SDE, SE2 and senior engineers — 8 reports, entries 35–42
- 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
With four reports, each topic appears once; what stands out is how light the CS-2 coding was compared with the later design rounds.
| Topic | Reports | Last seen |
|---|---|---|
| System design | 1 of 4 | Feb 2026 (report date) |
| Intervals | 1 of 4 | Jul 2025 (report date) |
| CS fundamentals (OS, databases, REST) | 1 of 4 | Jul 2025 (report date) |
| Recursion on nested lists | 1 of 4 | Apr 2025 |
| Strings and two pointers | 1 of 4 | Apr 2025 |
| Streams and queues | 1 of 4 | Nov 2024 (report date) |
| Arrays | 1 of 4 | Nov 2024 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Merge Overlapping Intervals (a variation of LC 56) | 1: 33 | Jul 2025 (report date) |
| Depth-Weighted Sum of a Nested List (LeetCode 339) | 1: 32 | Apr 2025 |
| Palindrome After At Most One Deletion (LeetCode 680) | 1: 32 | Apr 2025 |
| Earliest Unrepeated Letter in a Stream | 1: 34 | Nov 2024 (report date) |
| Longest Zero Run Between Ones | 1: 34 | Nov 2024 (report date) |
System Design
| Question | Reports | Last seen |
|---|---|---|
| Design a Ticket Booking System (DB choice, concurrency, low latency) | 1: 31 | Feb 2026 (report date) |
Language and CS Fundamentals
| Question | Reports | Last seen |
|---|---|---|
| Threads vs processes, memory paging, database indexing, REST basics | 1: 33 | Jul 2025 (report date) |
4 CS-2 and senior CS round 1 reports
31: Senior CS: ticket booking design first, then rejected on DSA
Report date: Feb 2, 2026 · Role: Senior Computer Scientist · Result: Rejected
Round 1: High-level design (first technical round)
- Design a movie ticket booking app like BookMyShow.
- The deep dive was on choosing the database: concurrency control, and low latency for booking and confirmation.
- The candidate felt they covered every deep dive.
After round 1: Round 2 was DSA. The interviewer planned two questions, but the whole hour went to Heaters (LC 475): brute force first, then a final version with edge cases. The candidate was rejected.
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: 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.
34: CS-2, one easy and one medium: stream characters and zero runs
Report date: Nov 27, 2024 · Role: Computer Scientist 2
First round (first technical round)
- A pure data structures and algorithms round with two problems, one easy and one medium.
- First non-repeating character in a stream: after each new character, output the first character so far that has appeared only once, or # if none. For x, x, y, z, y, z, w the output is x, #, y, y, z, #, w.
- Longest zero run between ones: find the longest run of zeros with a 1 on both sides. [1,0,0,1,0,0,0,1] gives 3. [0,0,0,0,1] and [1,0,0,0,0] both give 0, because those zeros touch an edge. [1,0,0,0,1,1,0,0,0,0,0,1] gives 5.
Only this round was described, and the result wasn't shared.
Common questions
Is the Adobe CS-2 first round hard?
Not in these reports. The CS-2 candidates described warm-up or easy-to-medium coding (32, 33, 34). The harder work came later: chess LLD and a C++ LRU cache (32), a notification LLD and file-storage design (33).
Does the Adobe senior Computer Scientist loop start with system design?
In the one report we have, yes: a ticket booking design with a deep dive on database choice and concurrency (31). The DSA round came second, and a single heaters problem took the whole hour.
Keep practicing
- Practice from these reports: Nested list depth-weighted sum (32); Palindrome after at most one deletion (32); merging overlapping intervals (33); First non-repeating character in a stream (34); Longest zero run between ones (34).
- Adobe coding bank: every Adobe algorithm problem in the question bank (sign-in needed).
- Adobe system design bank: the system 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.