Adobe SWE Interviews, Level Unknown: 25 Experiences (Part 2 of 3)

Shared by janebeingjane ·
Company
Adobe
Level
Unknown
Stages
Phone screen

Eleven Adobe software engineer reports with no level given, mostly from 2024: eight had a single interview, and linked lists came up in three.

At a glance

  • Process: usually one technical interview (8 of 11: SE 01, SE 03, SE 04, SE 07, SE 08, SE 09, SE 10, SE 11), mostly with one or two named tasks; SE 09 and SE 10 took an online test first. SE 08's one Yerevan session held seven timed problems with interviewers watching, and SE 02, SE 05 and SE 06 had more than one round (SE 06 three interviews after a 90-minute coding test).
  • Asked in these reports: linked lists in three of eleven (SE 03, SE 07, SE 10), trees in two (SE 04, SE 11), plus a string reversal (SE 01), integers to strings (SE 09), digit sums (SE 08) and a tic-tac-toe check (SE 05).
  • Difficulty: ratings split. SE 08 and SE 11 called the coding easy to easy-medium, and SE 09's two test problems were medium; SE 10 found its online test very hard and the interview's list reversal tame after it, and SE 06 called its four test questions very large. SE 02 passed 13 of 15 hidden tests in round 1 and was rejected after round 2.
  • Practise first: Reverse a Singly Linked List, Boundary of a Binary Tree, Anticlockwise and All Cousins of a Tree Node.

Coverage: 25 software engineers whose reports do not show whether they were interns, new grads or experienced hires (job titles include Software Engineer, SDE, Product Engineer, Java, C++ and PHP developer, MTS-1 and Computer Scientist; SE 09's post names both a product internship and SDE), in India, Romania, Armenia, France and the United States. Eleven are current (Nov 2023 to Sep 2024; SE 09's Feb 2024 is a report date, and SE 05's interview fell between Jul 2024 and Mar 2025); 14 from 2022 and 2023 sit in History.

In this series

What came up

Seven of the eleven current interviews were built around classic data-structure or string questions: linked lists (SE 03, SE 07, SE 10), trees (SE 04, SE 11) or strings (SE 01, SE 09). Three leaned on language or design theory: C++ (SE 02's second round, SE 10) and design patterns (SE 06); SE 10 had both the theory and a list reversal. Part 1 has the question tables.

11 detailed candidate timelines, loops, and screens

SE 01: reverse a string

Interview date: Sep 2024 · Role: Software Engineer · Location: India · Result: No offer

  1. Technical questions, a few on the company, and a coding task: reverse a string (Reverse a String). The candidate felt it went badly.

SE 02: hidden tests on HackerRank

Report date: Aug 2024 · Role: Computer Scientist, C++ · Location: Noida · Result: Rejected

  1. Round 1, the same day as round 2: two problems with hidden tests, a backtracking one and a structure that keeps returning and updating its minimum. The candidate used a priority queue and passed 13 of 15 tests; the interviewer could not see which failed but still wanted fully correct code.
  2. Round 2, with an engineer of 13 to 15 years: what is wrong with a given function (const, references, naming), when to pick a class or a struct (they disagreed on the facts), and a string question the candidate solved.

SE 03: merge, then reverse two ways

Interview date: Aug 2024 · Role: Associate Java Developer · Location: India · Result: No offer

  1. Merge two linked lists (the report does not say they were sorted; the closest practice is Merge Two Sorted Linked Lists), then reverse a linked list in two different ways (Reverse a Singly Linked List), with sharp follow-up questions.

SE 04: a tree's boundary

Interview date: Aug 2024 · Role: Product Engineer · Location: Noida · Result: No offer

  1. One technical round of 30 to 45 minutes in an online editor: resume questions and a boundary traversal of a binary tree (Boundary of a Binary Tree, Anticlockwise).

SE 05: a down-then-up stretch

Interview date: between Jul 2024 and Mar 2025 (report date Mar 2025) · Role: C++ Developer · Location: Noida · Result: Not disclosed

  1. Round 1: the length of a stretch of values that first falls and then rises (the report leaves the exact rule open), and checking a tic-tac-toe board (Is This Tic-Tac-Toe Board Reachable).
  2. Round 2: write memcpy, and an API that keeps k players' scores and reports the lowest one.

SE 06: design patterns for a PHP role

Interview date: Jul 2024 · Role: Junior PHP Developer · Location: Paris · Result: No offer

  1. A 90-minute coding test with four questions the candidate called very large, then a system design interview with a lead and a senior developer that asked which patterns system design uses. Hiring manager and director interviews followed; the opening later became a senior role and the process restarted.

SE 07: searching a circular list

Interview date: May 2024 · Role: Junior Software Engineer · Location: Romania · Result: No offer

  1. A language-specific interview (the candidate chose C++): how would you find a value in a circular list as quickly as possible?

SE 08: seven timed problems, watched live

Interview date: Apr 2024 · Role: Software Development Engineer · Location: Yerevan · Result: No offer

  1. A 90-minute CodeSignal session with interviewers present: seven problems, from easy up to easy-medium, about 13 minutes each, with a complexity review at the end. One was summing a number's digits until one digit is left, so 99 becomes 18 and then 9 (Add Digits Until One Remains).

SE 09: integers to strings

Report date: Feb 2024 (drive year 2023) · Role: product intern or SDE (the post names both) · Result: Not disclosed

  1. An online test of 35 multiple-choice questions and two problems the candidate rated medium.
  2. Three or four days later, a 45-minute interview with one DSA question: turn integers into strings, which the candidate compared to the string-to-integer parsing problem.

SE 10: C++ theory and a linked list

Interview date: Jan 2024 · Role: C++ Software Engineer · Location: Bucharest · Result: No offer

  1. A 60-minute online test that the candidate passed but found very hard, at a contest-programming level.
  2. A technical interview of tricky, theory-heavy C++ questions plus Reverse a Singly Linked List, which felt tame to the candidate after the test.

SE 11: cousins in a tree

Interview date: Nov 2023 · Role: SDE · Location: Noida · Result: Offer accepted

  1. Easy tree questions and the resume, including the cousins of a given node (All Cousins of a Tree Node).

History (before Nov 2023)

Fourteen older reports (Feb 2022 to Oct 2023), newest first.

SE H01: a Fibonacci-like subsequence

Interview date: Oct 2023 · Role: Software Engineer · Location: United States · Result: No offer

  1. LeetCode 873, a LeetCode medium, with hints from the interviewer; the candidate found it relaxed (Longest Fibonacci-Like Subsequence).

SE H02: Git versus GitHub

Interview date: Aug 2023 · Role: SDE · Location: Bengaluru · Result: No offer

  1. DBMS, OOP and OS concepts, how Git differs from GitHub, then the resume and open-source work.

SE H03: a tree's diameter, then an LLD surprise

Report date: Aug 2023 · Role: not stated (referral) · Result: Not selected after the director round

  1. Round 1 (about an hour): resume skills, project questions and the diameter of a binary tree, explained, dry-run and coded (Diameter of a Binary Tree).
  2. Later: copying a linked list with changes, and more project questions; a director's low-level design round the candidate was not ready for.

SE H04: mirror a tree, flatten JSON

Report date: Jun 2023 · Role: not stated (cloud digital experience team) · Result: Pending when posted

  1. Round 1 in the candidate's own editor: Mirror a Binary Tree and flattening {k1: [{k2: k3}, {k4: k6}]} into keys like k1_0_k2 (Flatten JSON With Array Indices).
  2. Round 2: LeetCode 2472 (7 of 15 tests passed), then LeetCode 5.

SE H05: brackets and a shared meeting slot

Interview date: Jun 2023 · Role: Software Engineer, contractor · Location: San Jose · Result: No offer

  1. Two LeetCode mediums, Are the Brackets Balanced and a meeting scheduler (Earliest Common Meeting Slot), with a supportive interviewer.

SE H06: C++ versus Java on the phone

Interview date: Feb 2023 · Role: Software Development Engineer · Location: Bucharest · Result: Offer accepted

  1. A phone screen on languages, memory and OS, including how C++ and Java differ; then three hours onsite with two DSA problems, and a soft-skills talk.

SE H07: merge sort and percentiles

Interview date: Jan 2023 · Role: Software Development Engineer · Location: Bucharest · Result: Offer accepted

  1. Phase 1: how merge sort works, what a percentile means, and the tools the candidate used to watch services. Next came one coding task and one design task, then a soft-skills talk.

SE H08: a singleton, then an LRU cache

Report date: Dec 2022 · Role: MTS-1 · Result: Selected the same evening

  1. Round 1 (75 minutes): virtual and friend functions, aggregation versus composition, multiple inheritance in C++, process versus thread, then a singleton in any language.
  2. Round 2: Is the String a Palindrome several ways, then for a linked list; a minimum stack in O(1) time and space; an LRU cache in code.
  3. Round 3: return every process killed when a parent dies; is one tree a subtree of another; validate an IPv4 address; a mixing-ratio puzzle.

SE H09: a min stack built from scratch

Report date: Aug 2022 · Role: SDE1 · Result: Rejected

  1. Round 1: Reverse a Singly Linked List, a "reverse of prefix sum" question solved with hints, and a min stack the candidate built from scratch when the interviewer expected the built-in stack (Stack With Constant-Time Minimum).
  2. Round 2: projects, Spring Boot bean scopes and internals, a generic queue from two stacks and merging two sorted arrays.

SE H10: a tree problem in twenty minutes

Interview date: Aug 2022 · Role: Software Development Engineer · Location: San Jose · Result: No offer

  1. A phone interview: experience, frameworks and web basics, then a medium tree problem (not named) in about 20 minutes.

SE H11: an endless 0/1 array

Interview date: Jul 2022 · Role: Software Development Engineer · Location: New Delhi · Result: No offer

  1. Camera on, coding while the interviewer watched: First 1 in an Endless Sorted 0/1 Array and whether two given nodes are cousins (the closest practice lists every cousin of one node: All Cousins of a Tree Node).

SE H12: exact jumps in a grid

Report date: Apr 2022 · Role: MTS-1 · Result: Rejected

  1. Round 1: store a small binary tree so each node's children can be found in O(1); the first letter that appears once, as in "aapple" giving "l" (First Character That Appears Once); the longest path of exact jumps in a grid (Longest Path of Exact Jumps in a Grid).
  2. Round 2: the bridge-and-torch puzzle, a symmetric tree, and a stack with O(1) find-middle and delete-middle.

SE H13: how the internet works

Interview date: Mar 2022 · Role: Software Engineer · Location: Bucharest · Result: No offer

  1. A general CS talk with one engineer: multithreading, OS processes and how the internet works.

SE H14: lists versus arrays

Interview date: Feb 2022 · Role: Junior Software Developer · Location: Bucharest · Result: No offer

  1. An interview the candidate found hard, in C++: lists, sets and complexity, including how a list differs from an array, with feedback at the end.

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

Next in this seriesAdobe Web, QA, DevOps, ML Roles: 13 Experiences (Part 3 of 3)
0 total reactions. Your reactions: none.

Comments

0

No comments yet — be the first to share what you know.