Adobe SWE Intern Interviews: 27 Experiences (Part 2 of 4)
- Company
- Adobe
- Level
- Internship
- Stages
- Phone screen
Ten Adobe software engineering intern reports, Nov 2023 to Aug 2024, show one interview with one to four coding problems, from trees to lists and arrays.
At a glance
- Process: an online test where reported, then one technical interview in eight reports (after a separate coding round for SWE 03 and SWE 09; with no online test for SWE 06), mixing coding with OS, DBMS, OOP or project questions.
- Asked in these reports: a tree boundary print (SWE 01), an undo-and-redo calculator (SWE 02), three array and backtracking problems (SWE 04), a REST SDK (SWE 07), four traversal and array problems (SWE 08), JSON traversal (SWE 10).
- Difficulty: easy to medium where rated (SWE 05, SWE 08); SWE 01 called the tree print hard. SWE 04 found the process easier than elsewhere but was rejected.
- Practise first: Boundary of a Binary Tree, Anticlockwise, Walk a Nested JSON Object Breadth-First and Depth-First and Add and Subtract With Undo and Redo.
Coverage: 27 software engineering interns (one on-campus intern gave no track) in India, the United States, Romania and Switzerland. Ten are current (Nov 2023 to Aug 2024); 17 from Jan 2022 to Oct 2023 sit in History.
In this series
- Part 1: overview and question tables
- Part 2 (current): software engineering interns
- Part 3: product interns and SheCodes
- Part 4: ML, research, web and consultant interns
What came up
The interviews asked trees (SWE 01, SWE 08), a linked list (SWE 03), arrays (SWE 04, SWE 08), a substring (SWE 06), undo and redo (SWE 02) and JSON or REST work (SWE 07, SWE 10); SWE 08's online test added a linked-list task. Three asked OS, DBMS or OOP (SWE 02, SWE 03, SWE 05).
10 detailed candidate timelines, loops, and screens
SWE 01: an anticlockwise tree print
Report date: Aug 2024 · Role: SDE Intern · Result: Rejected
- Online test: 35 multiple-choice and two coding questions in two hours.
- Interview: one project, then print a binary tree's boundary "anticlockwise", which the candidate called hard. They finished the code but skipped edge cases and running time, and think that cost them. Our version is Boundary of a Binary Tree, Anticlockwise. Easy BST questions closed the round.
SWE 02: a calculator with undo
Interview date: Aug 2024 · Role: Software Intern · Location: Bengaluru · Result: No offer
- Write add, subtract, undo and redo functions (Add and Subtract With Undo and Redo).
- Projects, DBMS and OS questions. The candidate found the interviewer helpful.
SWE 03: a doubly linked list, several ways
Interview date: Aug 2024 · Role: Software Engineer intern · Location: Bengaluru area · Result: No offer
- After a coding round, an interview on DSA, OOP and DBMS. The coding was a doubly linked list question; the interviewer wanted several approaches and helped when needed.
SWE 04: three coding problems on campus
Interview date: 2024 (report date May 2024) · Role: SDE Intern (on campus) · Result: Rejected
- After an online test (25 multiple-choice questions and two easy problems), the only interview had three coding problems: every path for a rat in a maze (All Paths for a Rat in a Maze); sort an array quickly with a correct implementation (Sort an Array Fast); and range sums from a prefix-sum array (Range Sum Queries With Prefix Sums). The candidate found the process easier than at other companies.
SWE 05: logic questions in Bucharest
Interview date: Feb 2024 · Role: Software Engineer intern · Location: Bucharest · Result: Offer accepted
- Simple logic questions and one easy-to-medium coding problem (not described), plus threads versus processes, multithreading, OOP and exceptions.
SWE 06: a repeat-free substring on a panel
Interview date: Feb 2024 · Role: Software Engineer Intern · Location: United States · Result: No offer
- A 60-minute panel with no online test: resume questions, then one LeetCode problem, the longest substring without repeated characters, returning its length and printing it. The closest practice is First and Last Longest Repeat-Free Substrings.
SWE 07: an SDK over REST
Interview date: Dec 2023 · Role: Software Engineer intern · Location: Basel · Result: No offer
- After an online test, two engineers ran 30 minutes of behavioral questions and an hour of technical work: an SDK over a REST API (Build an SDK That Gets and Puts Data Over REST).
SWE 08: four classic traversals
Report date: Nov 2023 · Role: Intern (on campus; track not stated) · Result: Not disclosed
- Online test: 30 multiple-choice questions on aptitude, DSA, OOP, OS and networking, and two coding problems: delete the even-valued nodes of a linked list, and count increasing "intersection points" between two arrays read as points on a graph.
- An easy DSA-only interview (others in the drive got CV-only ones): Values That Appear Twice, Read a Matrix in Spiral Order, level-order traversal and BFS of a graph.
SWE 09: fifteen minutes of code with the team
Interview date: Nov 2023 · Role: Software Engineer intern · Location: San Jose · Result: No offer
- After a coding round, a team lead and a teammate gave 15 minutes of coding (not described) and 30 minutes of behavioral and technical questions, including React components and a past project, plus time to meet the team.
SWE 10: walking a JSON object
Interview date: Nov 2023 · Role: Software Engineering Intern · Location: San Jose · Result: Offer accepted
- One round. Walk a JSON object breadth-first and depth-first, with full code, tests and a walk-through (Walk a Nested JSON Object Breadth-First and Depth-First).
- Why Adobe, past experience, and a time you struggled.
History (before Nov 2023)
Seventeen older reports, Jan 2022 to Oct 2023.
SWE H01: a string task with a manager
Interview date: Oct 2023 · Role: Software Engineer intern (from a career fair) · Location: San Jose · Result: No offer
- After an online test, a final round with a manager: one easy-to-medium string task.
SWE H02: code quality and good UI
Interview date: Sep 2023 · Role: Software Engineer intern · Location: United States · Result: No offer
- An easy online test, then 45 minutes with a team: 15 minutes of easy coding (not named) and 30 minutes of behavioral questions, including how you define code quality and a good user interface.
SWE H03: full binary trees and a divisibility check
Report date: Aug 2023 · Role: Software Engineer Intern · Result: Wait-listed, not converted
- Online test (two hours): 16 multiple-choice questions and three coding problems: the longest increasing subsequence, a binary search for the lowest speed that finishes all jobs, and the maximum subarray sum.
- Round 1: why software after an electrical engineering degree; Every Full Binary Tree With n Nodes; recursion and OS threads.
- Round 2: the candidate's project, then is a binary string divisible by 3, also for 10^9 characters (unfinished). An HR round for wait-listed candidates covered college life, teamwork, a stressful moment, why Adobe and where the candidate wanted to work.
SWE H04: word search and a power function
Interview date: Aug 2023 · Role: Software Intern · Location: New Delhi · Result: No offer
- Find a Word in a Letter Grid, Raise a Number to an Integer Power, and the running times of graph algorithms. The candidate found the hints hard to follow.
SWE H05: a top view with a twist
Interview date: Aug 2023 · Role: Software Engineer intern · Location: Roorkee · Result: Offer accepted
- A one-hour tree round: a twist on a binary tree's top view (Top View of a Binary Tree).
SWE H06: improving your own project
Interview date: Jan 2023 · Role: SDE intern · Location: United States · Result: No offer
- A 45-minute final round: a project's architecture and data API, how you would add a feature to it, and one algorithm problem in Java (not described).
SWE H07: the CSS box model
Interview date: Jan 2023 · Role: Software Engineer intern · Location: Bucharest · Result: Offer accepted
- Two engineers on a video call: HTML, CSS and JavaScript questions such as the box model, and one easy problem (not described). A soft-skills interview followed.
SWE H08: counting substrings
Interview date: Dec 2022 · Role: Software Developer Intern · Location: India · Result: No offer
- OOP concepts, then two medium string problems; one asked for the number of substrings meeting a rule the report does not give.
SWE H09: a queue from stacks in Romania
Interview date: Dec 2022 · Role: Software Engineer intern · Location: Romania · Result: Offer accepted
- A 90-minute interview: processes and threads (and why threads are needed), constructors, overloading versus overriding, Build a Queue From Two Stacks and Reverse a Singly Linked List. A manager interview followed.
SWE H10: a booking app and four quick problems
Interview date: Oct 2022 · Role: SDE intern (off campus) · Result: Rejected
- A 50-minute call: a movie ticket app (Design a Ticket Booking System); Are Two Strings Anagrams; find a peak element, answered with a linear scan (the closest practice is Find the Peak of a Rise-and-Fall Array); Diameter of a Binary Tree; a fair coin from a 60/40 coin.
SWE H11: a design pattern chat
Interview date: May 2022 · Role: Software Engineer intern · Location: Bucharest · Result: Offer accepted
- After a quiz, a technical interview on general CS that asked the candidate to talk through a design pattern. A manager interview followed, on experience, projects, goals and teamwork.
SWE H12: maps and sets
Interview date: Mar 2022 · Role: Software Engineer intern · Location: Bucharest · Result: Offer accepted
- What a map is and what a set is, asked by a patient interviewer.
SWE H13: steps to reach n
Interview date: Feb 2022 · Role: Software Engineer intern (graduate student, Java) · Location: United States · Result: No offer
- Ninety minutes on video with several engineers and a manager. The one named question: the minimum steps to reach n (no rules given).
SWE H14: merging two sorted arrays
Interview date: Jan 2022 · Role: Software Engineer intern · Location: India · Result: No offer
- Stack questions and a puzzle, a CV project, then merge two sorted arrays (Merge Into the Zero-Padded Array) and why join Adobe.
SWE H15: arrays versus linked lists
Interview date: Jan 2022 · Role: Software Developer Intern · Location: Bucharest · Result: No offer
- A 90-minute interview on the online test's topics: arrays versus linked lists, multithreading and OOP. HR followed.
SWE H16: a burning tree and bridges
Interview date: Jan 2022 · Role: SDE intern (on campus) · Location: Bengaluru · Result: Offer accepted
- Tough DBMS questions, then Time to Burn a Binary Tree From One Node and Bridges in an Undirected Graph.
SWE H17: a fast first screen, then a team forum
Report date: Jan 2022 · Role: Software Engineering Summer Intern · Location: United States · Result: Offer
- A rapid 30-minute first round: one simple question to optimise in words, OOP, DBMS and OS basics, SQL versus NoSQL, and behavioral questions.
- Final: four team interviews at a forum of 25+ teams, with two algorithm questions to code.
Keep practicing
- Boundary of a Binary Tree, Anticlockwise: SWE 01.
- Add and Subtract With Undo and Redo: SWE 02.
- All Paths for a Rat in a Maze: SWE 04.
- Sort an Array Fast: SWE 04.
- Range Sum Queries With Prefix Sums: SWE 04.
- First and Last Longest Repeat-Free Substrings: SWE 06.
- Build an SDK That Gets and Puts Data Over REST: project, SWE 07.
- Values That Appear Twice: SWE 08.
- Read a Matrix in Spiral Order: SWE 08.
- Binary Tree Level-Order Traversal by Levels: SWE 08.
- Breadth-First Order of a Graph: SWE 08.
- Walk a Nested JSON Object Breadth-First and Depth-First: SWE 10.
- Why do you want to work at Adobe?: behavioral question, SWE 10, SWE H03, SWE H14.
- Tell me about a time you struggled and how you got through it.: behavioral question, SWE 10.
- How do you define code quality? And what makes a good user interface?: behavioral question, SWE H02.
- Why do you want to work in software when your degree is in electrical engineering?: behavioral question, SWE H03.
- Every Full Binary Tree With n Nodes: SWE H03.
- Find a Word in a Letter Grid: SWE H04.
- Raise a Number to an Integer Power: SWE H04.
- Top View of a Binary Tree: SWE H05.
- Pick a project on your resume. How would you make it better or faster, or add a new feature to it?: behavioral question, SWE H06.
- Build a Queue From Two Stacks: SWE H09.
- Reverse a Singly Linked List: SWE H09.
- Design a Ticket Booking System: system design case, SWE H10.
- Are Two Strings Anagrams: SWE H10.
- Find the Peak of a Rise-and-Fall Array: SWE H10.
- Diameter of a Binary Tree: SWE H10.
- Merge Into the Zero-Padded Array: SWE H14.
- Time to Burn a Binary Tree From One Node: SWE H16.
- Bridges in an Undirected Graph: SWE H16.
- Adobe coding questions: all of Adobe's coding problems (sign-in needed).
- Adobe behavioral questions: Adobe's behavioral questions (sign-in needed).
- Adobe system design questions: Adobe's system 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.