Nov 2024–Nov 2026 Adobe Experienced-Hire First Technical Round: 69 Experiences (Part 5 :)
- 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 (current): 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
Six rounds from Jun to Apr 2025; every one was built on array and string coding.
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 26–31 of 69, general software engineers (MTS-1, MTS-2, Computer Scientist 1), India where a place was given, Jun–Apr 2025.
Other Adobe first-round roundups: interns · hiring level not reported
What came up
All six rounds centered on array and string problems, often two well-known ones back to back. Two also tested dynamic programming, and two used stacks or queues.
| Topic | Reports | Most recent report |
|---|---|---|
| Arrays and strings | 6 of 6 | Jun 5, 2025 (report date) |
| Dynamic programming | 2 of 6 | Jun 5, 2025 (report date) |
| LRU/LFU cache design | 1 of 6 | Jun 5, 2025 (report date) |
| Low-level and object-oriented design | 1 of 6 | Jun 5, 2025 (report date) |
| Java | 1 of 6 | Jun 5, 2025 (report date) |
| Hash maps and counting | 1 of 6 | May 27, 2025 |
| Graphs (BFS/DFS) | 1 of 6 | May 27, 2025 |
| Trees | 1 of 6 | May 27, 2025 |
| Stacks and queues | 2 of 6 | May 4, 2025 (report date) |
| Greedy | 1 of 6 | May 4, 2025 (report date) |
| Sorting and binary search | 1 of 6 | May 4, 2025 (report date) |
| Build, CI/CD and cloud tools | 1 of 6 | Apr 14, 2025 (report date) |
| Machine learning | 1 of 6 | Apr 14, 2025 (report date) |
| Resume and project deep dive | 1 of 6 | Apr 6, 2025 (report date) |
| Sliding window and two pointers | 1 of 6 | Apr 6, 2025 (report date) |
| OS, DBMS and networking basics | 1 of 6 | Apr 6, 2025 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Frequency | All last seen dates |
|---|---|---|
| Largest Product Stretch and Its Bounds (LC 152) | 1 report | Jun 5, 2025 (report date) |
| Least Recently Used Cache With O(1) Calls (LC 146) | 1 report | Reports: Jun 5, 2025 (report date); Additional FastPrep history: Jul 24, 2025 |
| Count Sentences From Anagram Swaps | 1 report | May 27, 2025 |
| Hubs With the Shortest Longest Chain (LC 310) | 1 report | May 27, 2025 |
| Rebuild the Queue From Taller-in-Front Counts | 1 report | May 4, 2025 (report date) |
| Longest Properly Closed Bracket Run (LC 32) | 1 report | May 4, 2025 (report date) |
| Do the Range Decrements Zero the Array | 1 report | Apr 14, 2025 (report date) |
| First and Last Longest Repeat-Free Substrings (LC 3) | 1 report | Apr 6, 2025 (report date) |
| Fill an n x n Grid in Spiral Order (LC 59) | 1 report | Apr 5, 2025 (report date) |
| Build a Queue From Two Stacks (LC 232) | 1 report | Apr 5, 2025 (report date) |
Low-Level Design (LLD/OOD)
| Question | Frequency | All last seen dates |
|---|---|---|
| Refactor a Cache for Pluggable Eviction Policies | 1 report | Jun 5, 2025 (report date) |
Machine Learning
| Question | Frequency | All last seen dates |
|---|---|---|
| ML questions on the candidate's own background (topic only) | 1 report | Apr 14, 2025 (report date) |
Language and CS Fundamentals
| Question | Frequency | All last seen dates |
|---|---|---|
| DBMS (ACID, locks, indexing), OS (deadlocks, multithreading) and load balancing | 1 report | Apr 6, 2025 (report date) |
DevOps and Cloud
| Question | Frequency | All last seen dates |
|---|---|---|
| Questions about Amazon S3 (topic only) | 1 report | Apr 14, 2025 (report date) |
6 detailed candidate timelines, loops, and screens
26: MTS-2 Java with a Node.js past: product subarray and a swappable cache
Report date: Jun 5, 2025 · Role: MTS-2 (Java; previously a Node.js developer) · Location: Noida, India · Result: Offer
Round 1: Mostly DSA (first technical round)
- Maximum Product Subarray (LC 152). The follow-up asked for the subarray itself, not just the product.
- An LRU cache in Java with O(1) get and put (LC 146).
- Then a design twist on the same code: let the user pick the eviction rule (LRU, LFU and so on) while reusing as much code as possible. That part lines up with refactoring a cache for pluggable eviction policies.
- The candidate passed.
After round 1: Round 2 covered Java OOP (abstract classes vs interfaces, polymorphism, Thread/Runnable/Callable) and a layered design from API contracts, then SQL joins. A manager round asked about projects, business impact and AI use. A director round dug into a MySQL-to-Cassandra migration. The selection call came in the third week.
27: MTS-2 hiring drive: anagram sentences and tree hubs
Interview date: May 27, 2025 · Role: MTS-2 · Experience: 2 years 1 month · Result: Offer
Round 1: Problem solving (first technical round)
- All rounds ran on one day as part of a hiring drive.
- Count Anagram Sentences: given a word list and m sentences, count for each sentence how many sentences you can make by swapping each word for any anagram of it from the list. Return one count per sentence. One example list was listen, silent, it, is.
- Hubs That Minimize the Longest Reporting Chain (LC 310): an org tree of n departments joined by n-1 undirected edges. Return every department that, used as the center, makes the tree as short as possible. For a star around node 1 the answer is [1]; another example had two answers, [3, 4].
- The candidate answered both. The email for round 2 arrived about ten minutes later.
After round 1: Round 2 asked the tree-hub problem again (now in O(n)) plus top k most viewed product IDs. Round 3 was LLD of a notification service for SMS, WhatsApp and push. The hiring manager round covered microservices vs monolith and disagreeing with leadership. The candidate felt it was a lean hire, but an offer followed.
28: CS-1 from an EDA company: queue by heights, then parentheses
Report date: May 4, 2025 · Role: Computer Scientist 1 · Experience: 4 years · Location: Noida, India · Result: Rejected
Round 1: Coding (first technical round)
- A recruiter reached out, and both rounds were on the same day.
- Rebuild the queue from taller-in-front counts: n people with unique heights, plus for each person the number of taller people standing ahead. Print the heights in real queue order. Example: heights [5,3,2,6,1,4] with counts [0,1,2,0,3,2] give [5,3,2,1,6,4].
- Working code was required. The candidate sorted first, then placed people in an O(n²) pass. The interviewer seemed fine with that complexity.
- Longest Valid Parentheses (LC 32). Only the approach was needed here, no code.
After round 1: Round 2 had three problems: kth smallest in a BST, longest substring without repeats, and removing the nth node from the end of a list, done recursively. Nine days later the answer was no.
29: MTS-2 with an ML background: range decrements, S3 and ML talk
Report date: Apr 14, 2025 · Role: MTS-2 · Experience: 2+ years · Result: Offer
Round 1: First round (first technical round)
- A recruiter set it up.
- Can range decrements make the array zero: an array of positive numbers and a list of (i, j) ranges. Each range lowers every element inside it by 1. Say whether the whole array can end at zero.
- Questions about Amazon S3. The exact questions weren't shared.
- ML questions tied to the candidate's own background, also not listed.
After round 1: Round 2 was the celebrity problem and a design for a universal query maker. Round 3, which the candidate felt was their worst, had subsets, resume talk, a chat-completion API signature and test cases. The manager round had cousins in an n-ary tree, a rough design of a Flask app and behavioral questions. The offer call came two or three days later.
30: MTS-1 after one year: longest unique substring and core CS
Report date: Apr 6, 2025 · Role: MTS-1 · Experience: 1 year · Result: Offer (accepted)
Before the first technical round: An HR phone screen covered the job profile, the candidate's experience and scheduling.
Round 1: Technical round I (first technical round)
- One hour, and it was an elimination round.
- Detailed questions on projects from the candidate's previous company.
- Longest Substring Without Repeats and Its Text (LC 3): find the length with a sliding window, then print the first or last substring that has that length.
- Core CS: ACID, locks and indexing in databases; deadlocks and multithreading in operating systems; load balancing in distributed systems.
- The candidate passed.
After round 1: Technical round II (40 minutes) asked for a binary tree's diameter, including writing the node class, plus pass-by-reference in Java vs C++. A 70-minute manager round mixed next greater element, producer-consumer, REST design and a lift system. A director round asked for full KMP and Kadane code. The candidate was selected and accepted.
31: CS-1 rejected despite solving both: spiral matrix and a stack queue
Report date: Apr 5, 2025 · Role: Computer Scientist 1 · Location: Noida, India · Result: Rejected
Round 1 (first technical round)
- Fill an n x n matrix in spiral order (LC 59). The interviewer showed the full spiral matrix as the expected print. The candidate built and printed it, and the interviewer said the logic was the same.
- Queue using two stacks (LC 232). The candidate first gave a working version. The interviewer wasn't satisfied, so they gave an optimized one.
- Recruiter feedback later said the first problem was not solved and the second was not optimized. The candidate was rejected after this round.
Keep practicing
- Least Recently Used Cache With O(1) Calls: practice problem from report 26.
- Largest Product Stretch and Its Bounds: practice problem from report 26.
- Refactor a Cache for Pluggable Eviction Policies: design question from report 26.
- Count Sentences From Anagram Swaps: practice problem from report 27.
- Hubs With the Shortest Longest Chain: practice problem from report 27.
- Rebuild the Queue From Taller-in-Front Counts: practice problem from report 28.
- Longest Properly Closed Bracket Run: practice problem from report 28.
- Do the Range Decrements Zero the Array: practice problem from report 29.
- First and Last Longest Repeat-Free Substrings: practice problem from report 30.
- Fill an n x n Grid in Spiral Order: practice problem from report 31.
- Build a Queue From Two Stacks: practice problem from report 31.
- Adobe coding questions: the company-filtered question bank (sign-in needed).
- Adobe low-level design questions: the company-filtered question bank (sign-in needed).
- Adobe ML modeling 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.