Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 3 :)
- Company
- Adobe
- Reports
- 7 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 (current): 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: 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
Seven rounds from May 2026 back to Nov 2025; two of them were design rounds, not coding rounds.
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 12–18 of 69, general software engineers (mostly Computer Scientist 1, one Senior Computer Scientist), India where a place was given, May 2026–Nov 2025.
Other Adobe first-round roundups: interns · hiring level not reported
What came up
Sliding-window problems led this group: three of the seven rounds had one, including the k-distinct substring and sliding window maximum. Two rounds included a design task, a ticket booking system for a Senior Computer Scientist and a versioned document service for a CS-I.
| Topic | Reports | Most recent report |
|---|---|---|
| Sliding window and two pointers | 3 of 7 | May 21, 2026 (report date) |
| Hash maps and counting | 2 of 7 | May 21, 2026 (report date) |
| Graphs (BFS/DFS) | 1 of 7 | Apr 23, 2026 |
| Linked lists | 1 of 7 | Apr 23, 2026 |
| Puzzles and probability | 1 of 7 | Apr 23, 2026 |
| Sorting and binary search | 2 of 7 | Mar 19, 2026 (report date) |
| Low-level and object-oriented design | 2 of 7 | Mar 19, 2026 (report date) |
| System design | 2 of 7 | Mar 19, 2026 (report date) |
| Arrays and strings | 1 of 7 | Mar 19, 2026 (report date) |
| Concurrency and threads | 1 of 7 | Feb 2, 2026 (report date) |
| Intervals | 1 of 7 | Jan 2026 |
| Resume and project deep dive | 1 of 7 | 2026 |
| Stacks and queues | 1 of 7 | 2026 |
| Streaming data | 1 of 7 | Nov 17, 2025 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Longest Stretch With At Most K Different Letters (LC 340) | 1 report | Reports: May 21, 2026 (report date); Additional FastPrep history: Jun 6, 2026 |
| Determine the Edit Distance in a Word Ladder (LC 127) | 1 report | Reports: Apr 23, 2026; Additional FastPrep history: May 29, 2025 |
| Linked List Add and Remove Operations (LC 707) | 1 report | Apr 23, 2026 |
| Search fast in an unsorted 50,000-element array | 1 report | Mar 19, 2026 (report date) |
| Count Inversions With Merge Sort | 1 report | Mar 19, 2026 (report date) |
| Unnamed easy-to-medium coding task (topic only) | 1 report | Mar 19, 2026 (report date) |
| Insert and Merge an Interval (LC 57) | 1 report | Jan 2026 |
| Next Upcoming Birthday (interface over name, parents, birth date) | 1 report | Jan 2026 |
| Largest Value in Every Sliding Window (LC 239) | 1 report | 2026 |
| Active Users in the Last Five Minutes | 1 report | Nov 17, 2025 (report date) |
System Design
| Question | Frequency | All last seen dates |
|---|---|---|
| Design a Ticket Booking System (DB choice, concurrency, low latency) | 1 report | Feb 2, 2026 (report date) |
Low-Level Design (LLD/OOD)
| Question | Frequency | All last seen dates |
|---|---|---|
| Design Collaborative Versioned File Storage (document service with versions and access control) | 1 report | Mar 19, 2026 (report date) |
Puzzles and Probability
| Question | Frequency | All last seen dates |
|---|---|---|
| Unnamed puzzle (topic only) | 1 report | Apr 23, 2026 |
7 detailed candidate timelines, loops, and screens
12: 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.
13: 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.
14: 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).
15: 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.
16: 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.
17: 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.
18: 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.
Keep practicing
- Longest Stretch With At Most K Different Letters: practice problem from report 12.
- Merge Overlapping Intervals: practice problem from report 12.
- Linked List Add and Remove Operations: practice problem from report 13.
- First Node Two Linked Lists Share: practice problem from report 13.
- Determine the Edit Distance in a Word Ladder: practice problem from report 13.
- Count Inversions With Merge Sort: practice problem from report 14.
- Design Collaborative Versioned File Storage: design question from report 14.
- Insert and Merge an Interval: practice problem from report 16.
- Next Upcoming Birthday: practice problem from report 16.
- Largest Value in Every Sliding Window: practice problem from report 17.
- Active Users in the Last Five Minutes: practice problem from report 18.
- Adobe coding questions: the company-filtered question bank (sign-in needed).
- Adobe system design 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.