Adobe Computer Scientist 1 Round 1: 8 Experiences (Part 4 of 12)
- Company
- Adobe
- Reports
- 8 interview reports
- Level
- Full-time
- Stages
- Phone screen
Adobe Computer Scientist 1 round 1 in 2025–2026 paired coding, often sliding-window problems, with talk about past projects.
At a glance
- Process: one technical round, sometimes at a hiring drive (16, 21, 22). Candidate 17 had both coding rounds on HackerRank on one day, and 18 had three rounds in one day. Later rounds were design (LLD or HLD), a hiring manager and often a director (22, 23).
- Asked recently: sliding-window problems in 3 of 8 (17, 20, 22), project talk in 3 (16, 20, 23), and tree problems in 2 (22, 23). Two rounds included design work: an open cache design (16) and a versioned document service (19).
- Difficulty: candidate 22 solved two medium problems in 30 minutes, and 23's interviewer swapped out a problem the candidate already knew. Candidate 18 solved only part of a puzzle. One of the eight reported an offer (23).
- Practise first: Longest Stretch With At Most K Different Letters, Largest Value in Every Sliding Window, Active Users in the Last Five Minutes and Least Frequently Used Cache Simulator.
Coverage: 8 Computer Scientist 1 reports (backend, Java and full stack where stated) from Jul 2025 to Aug 2026, in Noida and Bangalore where a place was given. The series covers 69 experienced-hire reports from Nov 2024 to Nov 2026, 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 (current): Computer Scientist 1, Jul 2025–Aug 2026
- 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: 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 leaned on sliding windows and trees, and most rounds also asked about the candidate's own work.
| Topic | Reports | Last seen |
|---|---|---|
| Past projects and résumé | 3 of 8 | Aug 2026 |
| Sliding window | 3 of 8 | Jul 2026 (report date) |
| Cache design or LFU discussion | 2 of 8 | Aug 2026 |
| Trees | 2 of 8 | Jul 2025 (report date) |
| Graphs (BFS) | 1 of 8 | Apr 2026 |
| Linked lists | 1 of 8 | Apr 2026 |
| Puzzles | 1 of 8 | Apr 2026 |
| Sorting and searching | 1 of 8 | Mar 2026 (report date) |
| Document service design | 1 of 8 | Mar 2026 (report date) |
| Time-window counting on a stream | 1 of 8 | Nov 2025 (report date) |
| Dynamic programming | 1 of 8 | Jul 2025 (report date) |
| Java concurrency | 1 of 8 | Jul 2025 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Largest Value in Every Sliding Window (LeetCode 239) | 1: 20 | Jul 2026 (report date) |
| Longest Stretch With At Most K Different Letters (LeetCode 340) | 1: 17 | May 2026 (report date) |
| Determine the Edit Distance in a Word Ladder (LeetCode 127) | 1: 18 | Apr 2026 |
| Linked List Add and Remove Operations (LeetCode 707) | 1: 18 | Apr 2026 |
| Search fast in an unsorted 50,000-element array | 1: 19 | Mar 2026 (report date) |
| Count Inversions With Merge Sort | 1: 19 | Mar 2026 (report date) |
| Active Users in the Last Five Minutes | 1: 21 | Nov 2025 (report date) |
| Least Frequently Used Cache Simulator (LeetCode 460) | 1: 22 | Jul 2025 (report date) |
| Cheapest Order to Cut a Rod (LeetCode 1547) | 1: 23 | Jul 2025 (report date) |
| Rebuild a Binary Tree From Two Walks (LeetCode 105) | 1: 23 | Jul 2025 (report date) |
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Design a cache (no other requirements given) | 1: 16 | Aug 2026 |
| Design Collaborative Versioned File Storage (document service with versions and access control) | 1: 19 | Mar 2026 (report date) |
Language and CS Fundamentals
| Question | Reports | Last seen |
|---|---|---|
| How to handle concurrency in Java | 1: 23 | Jul 2025 (report date) |
8 Computer Scientist 1 round 1 reports
16: CS-1 hiring drive in Bangalore: resume talk and an open cache design
Interview date: Aug 13, 2026 · Role: Computer Scientist 1 · Location: Bangalore, India · Result: Positive feedback on three rounds, then put on hold by a hiring freeze
Round 1 (first technical round, at a hiring drive)
- A discussion based on the resume.
- Design a cache. No further requirements were reported.
The recruiter said the feedback from this round was positive.
After round 1: Round 2 had Asteroid Collision (LC 735), one SQL question, and system design ideas including idempotency. Round 3 was resume and behavioral. A director round asked a sales-related system design, which the candidate answered about halfway. The process then paused for a hiring freeze.
17: CS-1 backend, first interview since college: k-distinct substring
Report date: May 21, 2026 · Role: Computer Scientist 1 (backend) · Experience: 5.8 years · Location: Noida, India · Result: Not disclosed (the candidate felt the last two rounds went badly)
R1: DSA (first technical round)
- A recruiter reached out. Both DSA rounds were on HackerRank on the same day.
- The interviewer joined late and went straight to the problem.
- Longest substring with at most k distinct characters (LC 340). The candidate had seen it before. They used a sliding window, coded it, and explained it without trouble.
They passed.
After round 1: R2 was a talk about current work plus merge intervals (LC 56), which they solved. R3 was face to face in Noida: a project deep dive and a URL shortener design. R4 (hiring manager) was a YouTube-style video design and didn't go well. R5 was an AI-assisted LLD of a feature flag service on HackerRank, which went badly.
18: CS-1, three rounds in one day: word ladder and linked-list operations
Interview date: Apr 23, 2026 · Role: Computer Scientist 1 · Result: Waiting; the candidate wasn't sure if it was borderline or a reject
Round 1 (first of three same-day rounds)
- Word Ladder (LC 127): turn a start word into an end word one letter at a time. The candidate talked through a BFS approach.
- Linked list add and remove operations (LC 707).
- One puzzle. It wasn't described, and the candidate solved it only partly.
After round 1: Round 2 was Insert Delete GetRandom O(1) (hash map plus array list) and Peeking Iterator, where the interviewer wanted the existing iterator wrapped instead of copied into a list. Round 3 was where two linked lists meet (LC 160), with a follow-up about millions of lists that share tails; the candidate solved the base case but not the scaled one.
19: CS-I: inversion count and a versioned document store
Report date: Mar 19, 2026 · Role: Computer Scientist I · Result: Told the team wanted more experience; another team or an MTS-2 level was discussed, and the candidate declined to interview again
R1: DSA and LLD (first technical round)
- A recruiter reached out first.
- How to search fast in an unsorted array of 50,000 elements.
- Count inversions using merge sort.
- One more easy-to-medium coding task that wasn't named.
- A service for documents, similar to a file-sharing app: uploads, versions, access control, soft and hard deletes, and large files, with API design and scaling (design practice).
After round 1: R2 was a near-real-time views, likes and comments analytics system with Kafka ingestion. R3 was concurrency: a thread-safe O(1) LRU cache with expiry and a producer/consumer simulation. R4 was a two-hour deep dive into a past project (Kafka, sharding, SQL vs NoSQL, caching).
20: CS-1 full stack: projects and sliding window maximum
Interview date: 2026 (report date Jul 17, 2026) · Role: Computer Scientist 1 (full stack) · Experience: 4 years · Location: Bangalore/Noida, India · Result: Rejected after the hiring manager round
Round 1: Past projects + DSA (first technical round)
- A talk about past projects.
- Sliding window maximum (LC 239).
Feedback was positive.
After round 1: Round 2 was the HLD of the candidate's own project plus a 30-minute frontend task: autocomplete search fed by an API, with optimizations. Round 3 (hiring manager) covered how the earlier rounds went, the CV, AI use and a two-month gap. They were rejected.
21: CS-1 drive in the ALM org: active users in the last five minutes
Report date: Nov 17, 2025 · Role: Computer Scientist 1 (ALM org, hiring drive) · Experience: 4 years · Result: Rejected
Round 1: Tech (first technical round, at a hiring drive)
- A stream of log entries arrives as (timestamp in seconds, userId, eventType), with timestamps going up.
- After each event, report how many unique users had at least one event in the last 5 minutes, counting back from the current event's timestamp.
After round 1: Round 2 was Most Stones Removed with Same Row or Column (LC 947), Java threads changing a shared list or map, shallow vs deep copy, and SQL internals. Round 3 (hiring manager) asked for the most complex project's HLD, a design conflict with a senior, and a detailed BookMyShow schema. The candidate was rejected.
22: CS-1 drive: three unnamed problems in an hour, plus LFU talk
Report date: Jul 18, 2025 · Role: Computer Scientist 1 · Experience: 4.5 years · Result: Rejected after the director round
Round 1: DSA (first technical round, virtual hiring drive)
- One hour. The candidate coded in their own IDE and ran custom inputs.
- A medium sliding-window problem and a medium binary-tree problem. Neither was named. Both were solved within 30 minutes.
- A hard binary-tree problem, approach only. Not named either.
- A discussion of an LFU cache (LC 460).
The feedback was positive; the candidate rated it a strong hire.
After round 1: Round 2 on HackerRank had a balanced-parentheses variant (all tests passed), a Goodreads design with schemas, and multithreading scenarios. Round 3 (hiring manager) was projects and behavioral. The director round asked how they review a PR or design doc and about RabbitMQ internals. They were rejected.
23: CS-1 Java offer: stick cutting swapped for tree building
Report date: Jul 5, 2025 · Role: Computer Scientist 1 (Java) · Result: Offer, accepted
Round 1: DSA (first technical round)
- On HackerRank. It opened with an intro and questions on resume projects.
- A medium problem (not named). The candidate wrote working, optimal code with edge cases.
- Minimum cost to cut a stick (LC 1547). They spotted it as a standard DP problem, so the interviewer switched to another question.
- Build a binary tree from its preorder and inorder traversals (LC 105). Approach only; no code asked.
- Another medium problem (not named). They explained the approach, but the code wasn't done in time.
- How to handle concurrency in Java.
They passed.
After round 1: Two design rounds followed: a train ticket booking LLD (search, seats, routes, re-booking freed seats, schema and SQL), then a checkout flow with auth on the APIs. The managerial round included scheduling a meeting when the most users are free. After the director round, the candidate got and accepted the offer.
Common questions
What is the Adobe Computer Scientist 1 first round like?
Mostly coding with some project talk. Six of the eight named at least one coding problem; 16's round was résumé talk and an open cache design, and 19's added a document-service design.
What happens after round 1 for Adobe CS-1?
Design rounds came next in most loops: a URL shortener (17), an analytics system (19), a Goodreads design (22) and a train booking LLD (23). A hiring manager and often a director followed.
How long does the Adobe CS-1 process take?
Several candidates had rounds on a single day: 17's two coding rounds, 18's three rounds, and the hiring drives in 16, 21 and 22. Candidate 16's process then paused for a hiring freeze.
Keep practicing
- Practice from these reports: Asteroid Collision (16); Longest substring with at most k distinct characters (17); merge intervals (17); Word Ladder (18); Linked list add and remove operations (18); where two linked lists meet (18); Count inversions using merge sort (19); design practice (19); Sliding window maximum (20); how many unique users had at least one event in the last 5 minutes (21); LFU cache (22); Minimum cost to cut a stick (23); Build a binary tree from its preorder and inorder traversals (23).
- 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.