Adobe CS2 and Senior CS Interviews: 6 Experiences (Part 5 of 6)
- Company
- Adobe
- Level
- Full-time
- Stages
- Phone screen
Three 2024 Adobe CS2 first rounds each set two problems: a wildcard dictionary, autocomplete with movie screenings, or an XML parser.
At a glance
- Process: a first technical round of two problems (in Java for CS2 02; with C++ questions for CS2 01), then one to four more rounds; CS2 03 went through two coding rounds, a two-hour manager round and a bar raiser added after mixed feedback. CS2 03 got an offer; CS2 01 and CS2 02 were rejected.
- Asked in these reports: LeetCode 211 (CS2 01), book-title autocomplete and a movie-screening schedule (CS2 02), an XML deserializer (CS2 03).
- Practise first: Add and Search Words With Wildcards, Search Autocomplete With Top Suggestions and Deserialize XML Into a Tree.
Coverage: six experienced CS2 and senior CS 1 candidates in Noida and Bengaluru. Three are current (Jun to Aug 2024); three from 2022 sit in History.
In this series
- Part 1: overview and question tables
- Part 2: MTS-1 and MTS-2
- Part 3: SDE and senior software engineers
- Part 4: Computer Scientist 1
- Part 5 (current): CS2 and senior Computer Scientist
- Part 6: frontend, quality, release and manager roles
What came up
All three current first rounds had two coding tasks, and two of them were string work (CS2 01, CS2 02). C++ memory and polymorphism questions came with one (CS2 01). Part 1 has the question tables.
3 detailed candidate timelines, loops, and screens
CS2 01: a word dictionary and C++ memory bugs
Interview date: Aug 2024 · Role: CS2 · Location: Noida · Result: Rejected
Round 1: data structures and C++
- LeetCode 211: build a word dictionary that can add words and search with "." as a wildcard (Add and Search Words With Wildcards).
- Static and dynamic polymorphism, vptr and vtable, operator overloading.
- A code sample with memory bugs (stack versus heap) to fix, then where smart pointers help.
Later rounds
- A YouTube-subscribe object design, the clock angle at 3:15, virtual and private constructors and destructors, the nearest greater value on each side, and whether 2D points lie on one circle.
- Speeding up scrolling in a word processor, the closest value in a sorted array, and marking nodes of an n-ary tree dirty or partly dirty.
CS2 02: autocomplete and movie screenings in Java
Report date: Jun 2024 · Role: CS2 (8.5 years) · Location: Noida · Result: Rejected
Round 1: two problems in Java
- Autocomplete over a list of book titles. The report gives no ranking rule; the closest practice is Search Autocomplete With Top Suggestions, which ranks by search count.
- Given each movie's length (for example [2,1,3,1,1,2]) and the hour it is meant to start ([1,3,4,5,2,1]), write maxScreening() to fit in as many screenings as possible. The post gives the arrays and the signature but not every rule. Our version: Most Movie Screenings on One Screen.
Round 2: the earliest moment everyone is connected, from logs of [time, x, y] friendships; then the k most frequent words.
CS2 03: an XML parser, then four more rounds
Interview date: Jun 2024 · Role: CS2 · Location: Bengaluru · Result: Offer
Round 1: two questions
- A problem the candidate solved with a max-heap (not described).
- Write an XML deserializer, as in Deserialize XML Into a Tree.
Later rounds
- A union-find question on connected components; two Java threads that take turns printing even and odd numbers (Print Numbers in Order With Odd and Even Threads).
- Painting houses in three colours at least cost; Java IO versus NIO, loading jars at runtime with a URL class loader, and Base62 hashing for a short-URL service.
- A two-hour manager round: a past project that was complex, and why it was hard technically; Java generics (super and extends); designing thread-local storage and a debugger for a new language; a high-level design for diffs of file names; conflict-resolution questions.
- Bar raiser, added after mixed feedback: the previous project and its tech stack, active-active versus active-passive set-ups, compensating transactions to roll back work, Kafka versus RabbitMQ, and a cube-cutting puzzle.
History (before Nov 2023)
Three CS2 and senior CS reports from early to mid 2022 come last.
CS2 H01: a spreading infection on a same-day drive
Interview date: May 2022 · Role: CS2 · Location: Bengaluru · Result: Offer
- Round 1 on video: how long an infection takes to spread through a grid (Minutes Until All Oranges Rot); a fair dice() built from a random coin.
- Later, over six more rounds: word search in a grid and chess design; the candidate's last project, a puzzle about sending a treasure box with locks past a dishonest messenger, and printing all pairs with a given sum, duplicates included (Every Index Pair That Sums to a Target); a project and object storage like S3; a grasshopper's chances at each node of a tree, then of a graph; conceptual questions, validating an IP address and finding all factors of a number in a language the candidate had not used; a project talk for a team change.
CS2 H02: rotate in place
Report date: Feb 2022 · Role: CS-2 · Location: Bengaluru · Result: Not disclosed
- Round 1: rotate an array right by k without extra space (Rotate an Array In Place).
- Later: every permutation of a string and peeling a tree's leaves level by level; notifications for a shared document; the tallest mountain peak and a Twitter design; behavioral and design questions with the manager; a puzzle, multithreading and one data-structure question with the director.
CS2 H03: odd and even threads
Report date: Feb 2022 · Role: Senior CS 1, Cloud team (9+ years) · Location: Bengaluru · Result: Offer (declined)
- Round 1, onsite: two threads print 1, 2, 3 and so on in order, one taking odd numbers and one even (Print Numbers in Order With Odd and Even Threads).
- Later: serialise an n-ary tree; Dropbox, host fleet management, a cricket-scores site and Twitter designs; work history with the hiring manager.
Keep practicing
- Add and Search Words With Wildcards: CS2 01.
- Search Autocomplete With Top Suggestions: CS2 02.
- Most Movie Screenings on One Screen: CS2 02.
- Deserialize XML Into a Tree: CS2 03.
- Print Numbers in Order With Odd and Even Threads: project, CS2 03, CS2 H03.
- Minutes Until All Oranges Rot: CS2 H01.
- Find a Word in a Letter Grid: CS2 H01.
- Design a Chess Move Validation Model: low-level design case, CS2 H01.
- Every Index Pair That Sums to a Target: CS2 H01.
- Rotate an Array In Place: CS2 H02.
- All Rearrangements of a String: CS2 H02.
- 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 project coding questions: Adobe's multi-file coding projects (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.