Adobe SDE and Senior SWE Interviews: 9 Experiences (Part 3 of 6)
- Company
- Adobe
- Level
- Full-time
- Stages
- Phone screen
Five Adobe SDE-2 and senior engineer first rounds from 2023-24 ran from one coding problem to seven tasks, with linked lists and graphs in the mix.
At a glance
- Process: a first technical round of one or two coding problems (plus a puzzle and a design question in SDE 02), or seven tasks in 1.5 hours (SDE 03). Three went on: SDE 01 then had concurrency, system design and hiring-manager rounds; SDE 04 a DSA round and an engineering-manager round; SDE 05 DSA, a file-path design and hiring-manager rounds, with round 5 still pending.
- Asked in these reports: alternating-size linked-list reversal and top-three autocomplete (SDE 01), a palindrome number (SDE 02), a fair random number in a range (SDE 04), a course-ordering graph (SDE 05).
- Difficulty: SDE 03 needed about five of seven tasks to pass; SDE 02 called its palindrome question simple, but the call ended early.
- Practise first: Reverse Linked-List Groups of Alternating Sizes, Search Autocomplete With Top Suggestions and Fewest Terms to Finish All Courses.
Coverage: nine experienced engineers: eight titled SDE-2, SDE-3, Software Engineer II or senior software engineer (one Android), and one who gave no title, in Noida, Bengaluru and Yerevan (one gave only India and three no place). Five are current (Jan to Sep 2024, plus SDE 04, interviewed in 2023 and reported in Apr 2024); four from 2021 to Aug 2023 sit in History.
In this series
- Part 1: overview and question tables
- Part 2: MTS-1 and MTS-2
- Part 3 (current): SDE and senior software engineers
- Part 4: Computer Scientist 1
- Part 5: CS2 and senior Computer Scientist
- Part 6: frontend, quality, release and manager roles
What came up
Each of the five current first rounds looked different: linked-list and autocomplete problems (SDE 01), a palindrome number plus a puzzle and a design question (SDE 02), seven tasks on dates, strings and lists (SDE 03), a random-number generator for a range (SDE 04), and a sliding window plus a course-ordering graph (SDE 05). Part 1 has the question tables.
5 detailed candidate timelines, loops, and screens
SDE 01: two coding problems, then a concurrency round
Report date: Sep 2024 · Role: Senior Software Engineer (7 years) · Location: Noida · Result: Offer accepted
Round 1: coding
- Reverse the nodes of a linked list in groups whose size alternates: the first x nodes, then the next y, then x again, and so on. It is LeetCode 25 with a twist: Reverse Linked-List Groups of Alternating Sizes.
- Autocomplete: each product name comes with a frequency; for a typed prefix, return the three matching names with the highest frequency. See Search Autocomplete With Top Suggestions.
The candidate changed both prompts a little because of an NDA.
Later rounds
- Concurrency: a task scheduler that runs a task once at a start time or N times on a period, built with wait, notify and notifyAll. The candidate's first idea was a min-heap polled by workers; the interviewer wanted wait/notify. The round also covered Java's volatile and synchronized keywords.
- System design: a webinar platform whose Silver, Gold and Platinum licences cap attendees per webinar and per user, with about 60K active users.
- Hiring manager: scale a monolith you cannot change from 100K to 1M users. The candidate proposed ten copies behind a router that used consistent hashing on the user's email.
SDE 02: a two-hour slot that ended in thirty minutes
Interview date: Jun 2024 · Role: Senior Software Engineer, Android · Location: Bengaluru · Result: No offer
Round 1
- Decide whether an integer is a palindrome. The candidate finished in about 15 minutes. Our version: Is the Number a Palindrome?.
- A puzzle about two people who cannot see each other across a wall while a third person at its end sees both.
- Design how n connected traffic lights should turn green for the best flow.
The interviewer seemed disengaged and left the later questions unexplained. A rejection followed.
SDE 03: seven tasks in ninety minutes
Interview date: Apr 2024 · Role: Senior Software Engineer · Location: Yerevan · Result: No offer
- 1.5 hours, seven tasks from easy to hard on dates, strings and lists. About five were needed to pass; the candidate solved about four.
SDE 04: a fair random number in a range
Interview date: 2023 (report date Apr 2024) · Role: SDE 2 (almost 2 years) · Location: India · Result: Rejected after the manager round
Round 1: problem solving
- Build a random number generator for a range (L, R) where every value comes up about equally often. The candidate talked through several versions and how to improve them.
Later rounds
- Data structures, which went well: LeetCode 210, Course Schedule II (a topological sort); then the celebrity problem, finding the one guest whom everyone knows but who knows nobody with as few "does A know B" questions as possible. The candidate began with in- and out-degrees, then eliminated people with a stack.
- Engineering manager: why the current project used Oracle rather than MySQL, message-queue scenarios, the classes of a booking app from order creation to execution with card and UPI payments handled through the Strategy pattern, a time the candidate disagreed with teammates, and what to look for in a code review. The rejection came after this round.
SDE 05: topological sorting in round one
Report date: Jan 2024 · Role: SDE-2 (3 years 5 months) · Result: Pending when posted
Round 1: two problems
- A sliding-window and hash-map variation (not described further).
- A problem close to LeetCode 1136, Parallel Courses, like Fewest Terms to Finish All Courses.
Later rounds
- A string DP variation and a task like LeetCode 230 (k-th smallest value in a BST).
- Print a file's path when folders can be renamed (the candidate used a trie).
- Hiring manager: leadership questions, a project and a generic board-game interface.
History (before Nov 2023)
Four SDE reports from 2021 to Aug 2023, newest first.
SDE H01: stock trades and a burning tree
Report date: Aug 2023 · Role: SDE2 · Result: Rejected after round 3
- Round 1: LeetCode 188, best profit with at most k trades (Stock Profit With At Most k Trades); LeetCode 2385, the time for a fire to spread through a binary tree from one node, solved with both BFS and DFS (Time to Burn a Binary Tree From One Node); drawbacks of microservices.
- Later: a thread-safe LRU cache, two-sum on a sorted doubly linked list, SQL joins, multiple inheritance in Java, a thread-safe singleton; then Redis and a Kafka-style design with offsets for many subscribers.
SDE H02: meeting rooms and a word grid
Report date: Aug 2022 · Role: not given (3 years 3 months) · Location: Noida · Result: Not disclosed
- Round 1: the fewest meeting rooms for intervals such as [0,50], [5,10], [2,7], [8,20], [30,40] (answer 3) (Fewest Rooms for All Meetings); find a word like "APPLE" in a letter grid moving up, down, left or right (Find a Word in a Letter Grid).
- Later: burning a binary tree from a node and a shared_ptr in C++; projects, multithreading, deadlocks and a thread-safe singleton with the manager; projects, behavioral questions and a basic linked-list task with the director.
SDE H03: a linked list without extra space
Interview date: Jun 2022 · Role: Software Engineer II · Location: Bengaluru · Result: No offer
- Round 1 (after an online test): threads versus processes, then reverse a linked list in place and state its cost (Reverse a Singly Linked List).
- Round 2: a tree catches fire at a leaf and the fire spreads one edge per millisecond; how long until it all burns (Time to Burn a Binary Tree From One Node).
SDE H04: outlining shapes in an image
Report date: May 2021 · Role: SDE-3 · Result: Offer
- Round 1 (60 minutes): trace the edge of every shape in a picture. The interviewer let the candidate assume imaging APIs and RGB values; after 15 minutes of clarifying, a DFS solved it (Outline of Shapes in an Image).
- Later: a binary tree problem, an array problem with binary search, and OS and C++ concepts; a multithreading design and a recursion problem; with the director, projects, OS, a caching design and managerial questions.
Keep practicing
- Reverse Linked-List Groups of Alternating Sizes: SDE 01.
- Search Autocomplete With Top Suggestions: SDE 01.
- Is the Number a Palindrome?: SDE 02.
- Fewest Terms to Finish All Courses: SDE 05.
- Stock Profit With At Most k Trades: SDE H01.
- Time to Burn a Binary Tree From One Node: SDE H01, SDE H02, SDE H03.
- Fewest Rooms for All Meetings: SDE H02.
- Find a Word in a Letter Grid: SDE H02.
- Reverse a Singly Linked List: SDE H03.
- Outline of Shapes in an Image: SDE H04.
- Adobe coding questions: all of Adobe's coding problems (sign-in needed).
- Adobe system design questions: Adobe's system design cases (sign-in needed).
- Adobe low-level design questions: Adobe's object design cases (sign-in needed).
- Adobe interview guide: the company's interview overview.
- Adobe hiring insights: hiring activity over time.
- Experience feed: more interview reports and roundups.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.