What is the interview process like at Adobe?

Adobe runs an unusually long, elimination-style engineering loop that is heavily weighted toward data structures and algorithms plus core CS fundamentals, with comparatively little classic distributed-systems design until senior levels. Campus and intern hiring in India (Noida/Bengaluru) is compressed into an online assessment of aptitude and CS-fundamental MCQs plus two coding problems, followed by usually one or two technical interviews. Experienced hiring for MTS/Computer Scientist levels stacks three to seven rounds - multiple DSA rounds, a language/OS deep-dive, low-level design, a hiring-manager round and often a director round - with candidates advancing only after clearing each one.

What topics does Adobe test in interviews?

Commonly reported topics include Quicksort, C, OpenMP, Parallelism, LeetCode-style coding, System design.

Adobe Interview Questions & Experience

Role not stated

Received an offer

unknown. 1 round. Shared by bad_user on hn, 2011-03-29

1Coding interviewTechnicalWrote an in-place quicksort in C and talked through a parallel version.Covered: Quicksort, C, OpenMP, Parallelism

Software Engineer

Received an offer

unknown. 1 round. Shared by ThereIsNoWorry on hn, 2022-11-09

1Interview processTechnicalPassed coding, design and behavioral rounds and received an offer, declined over lack of full remote.Covered: LeetCode-style coding, System design, Behavioral stories

Software engineering intern

Outcome not shared

Internship. 3 rounds. Shared by Anonymous on gfg, 2025-07-23

1Resume shortlistPhone screenA pure paper screen on the resume before anyone was invited to the assessment.Covered: Resume deep-dive
2Online assessmentOnline assessmentThirty multiple-choice questions spread across aptitude and CS fundamentals, most of them testing basics rather than depth, plus two coding problems on linked lists and arrays.Covered: Aptitude, Data structures & algorithms, OOP, Operating systems, Networking
3Technical interviewTechnicalThe author notes the round varied a lot between candidates: some got only resume questions, others only coding. This candidate got four easy-to-moderate problems spanning array frequency counting, matrix traversal, tree level-order and graph BFS.Covered: Arrays & strings, Trees, Graphs, Past projects

Product intern

Not selected

Internship. 2 rounds. Shared by yashureddygodugunuri on gfg, 2024-06-04

1Online assessmentOnline assessmentA mixed aptitude section covering logical, quantitative and verbal reasoning, followed by two algorithmic coding questions.Covered: Aptitude, Data structures & algorithms
2Technical interviewTechnicalStarted as a resume-driven conversation, including a deep dive into a cybersecurity hackathon the candidate had listed, then moved through core-subject theory and two coding problems on circular linked lists and a house-robber style dynamic programming task.Covered: Resume deep-dive, OOP, DBMS, Networking, Past projects

SDE intern

Not selected

Internship. 2 rounds. Shared by Anonymous on gfg, 2024-05-02

1Online assessmentOnline assessmentTwenty-five MCQs on core subjects with Java-flavoured OOP questions, plus two straightforward coding problems. Shortlisting before this was purely CGPA-based.Covered: Operating systems, DBMS, OOP, Data structures & algorithms
2Technical interviewTechnicalThree problems: a rat-in-a-maze path enumeration, writing quicksort correctly end to end, and building and querying a prefix-sum array.Covered: Backtracking, Sorting, Arrays & strings

Product intern

Received an offer

Internship. 2 rounds. Shared by sanyamcoder on gfg, 2024-08-26

1Online assessmentOnline assessmentTwo coding problems ranging from easy-medium to medium-hard alongside thirty MCQs on C, DBMS and OOP. The author only got full test-case acceptance in the closing minutes.Covered: Data structures & algorithms, DBMS, OOP
2Technical interviewTechnicalOpened with a project walkthrough including a live demo that failed on the spot, then four coding problems on a shared CodePair editor with built-in test cases: merging sorted arrays, minimum swaps to balance parentheses, implementing a queue from stacks, and finding a linked list's midpoint. Some were code, some approach-only.Covered: Past projects, Arrays & strings, Stacks and queues, Linked lists

SDE intern

Not selected

Internship. 2 rounds. Shared by shadmasido6ad on gfg, 2024-08-20

1Online assessmentOnline assessmentThirty-seven questions in two hours, of which thirty-five were MCQs and two were coding problems.Covered: Data structures & algorithms, Aptitude
2Technical interviewTechnicalA single-project discussion followed by a hard binary-tree traversal problem and easier binary-search-tree questions. The candidate had the approach but was faulted for not covering edge cases and complexity.Covered: Past projects, Trees, Time complexity

Product intern

Received an offer

Internship. 2 rounds. Shared by Anonymous on gfg, 2024-08-09

1Online assessmentOnline assessmentMedium-difficulty DSA coding problems plus theory MCQs on data structures and OOP. Thirty-five candidates were shortlisted from the whole cohort.Covered: Data structures & algorithms, OOP
2Technical interviewTechnicalRoughly fifty minutes, with about twenty of them spent dissecting a web-development project. Then an easy array-scanning problem solved with a dry run and complexity discussion, followed by a binary-tree path problem where the interviewer pushed for a lower-space optimisation. Closed by asking why the candidate wanted Adobe.Covered: Past projects, Arrays & strings, Trees

Software engineering intern

Received an offer

Internship, 12LPA. 2 rounds. Shared by Shreya Gupta (naukri code360) on blog, 2022-10-01

1Online assessmentOnline assessmentAn emailed online assessment after applying through a diversity-focused drive whose link was routed via the college placement cell. Clearing it triggered scheduled interview rounds.Covered: Data structures & algorithms, OOP, Puzzles
2Interview roundsTechnicalThe author describes scheduled interviews testing both technical and problem-solving ability roughly a week before the final decision, but does not break down individual rounds.Covered: Data structures & algorithms, Past projects

Member of Technical Staff 1

Received an offer

Experienced. 4 rounds. Shared by aadarshgupta2 on gfg, 2025-07-23

1Online assessmentOnline assessmentNinety minutes total: an hour for two basic coding problems and then three ten-minute aptitude sections covering mental ability, comprehension and reasoning.Covered: Data structures & algorithms, Aptitude
2Technical interviewTechnicalA single binary-tree boundary-traversal problem, with the interviewer specifically pushing for a one-pass solution after the approach was explained.Covered: Trees
3Technical interviewTechnicalTwo problems: a sliding-window string question with a bounded number of allowed character changes, and a grid shortest-path question with a budget for removing obstacles, which was then made harder by allowing movement in all four directions.Covered: Arrays & strings, Graphs, Dynamic programming
4Managerial roundHiring managerA blend of project discussion, HR-style questions and computer-networking theory, closing with a linked-list rearrangement problem separating odd and even positioned nodes.Covered: Past projects, Behavioral, Networking, Linked lists

Computer Scientist 1

Outcome not shared

Experienced. 5 rounds. Shared by Anonymous on gfg, 2025-07-23

1Technical interviewTechnicalAn hour of DSA where the interviewer expected production-quality code, covering fast exponentiation including negative exponents, search in a sorted matrix, and grouping anagrams.Covered: Data structures & algorithms, Arrays & strings, Binary search
2Technical interviewTechnicalFifty minutes on quicksort and heap-sort mechanics and their complexities, C++ code-snippet output questions, and a project discussion.Covered: Sorting, Data structures & algorithms, Past projects
3Hiring managerHiring managerDesigning an iterator over a binary search tree, plus allocating a two-dimensional array with malloc and then reducing the number of allocation calls.Covered: Trees, Low-level design, Memory management
4Second hiring managerHiring managerScheduled with a different team's manager because the previous round's feedback was only average. Nearly the whole hour went on one optimisation problem, taken from a recursive solution to a DP formulation.Covered: Dynamic programming
5Director roundFinalMostly behavioural: current role, what the candidate personally built, challenges, how a manager would describe them and where they rank in their team, each answer needing justification. A Dutch-national-flag sorting problem was slotted in the middle, coded in an IDE of the candidate's choice.Covered: Behavioral, Past projects, Arrays & strings

Software engineer (4 years experience)

Outcome not shared

Experienced. 4 rounds. Shared by Anonymous on gfg, 2025-07-23

1Technical interviewTechnicalA problem-solving hour: integer square root without library functions, array rotation with a demand for a divide-and-conquer alternative, minimum squares summing to n, connecting same-level tree nodes in constant space, and a box-stacking maximisation with fixed then variable dimensions.Covered: Data structures & algorithms, Dynamic programming, Trees, Arrays & strings
2Technical interviewTechnicalBecause the candidate was not strong in Java, this round went deep on Java concepts: singleton and thread-safe initialisation, garbage collection, the string pool and immutability, inheritance versus composition, dependency injection, HashMap internals, equals/hashCode contracts, strategy and observer patterns, and thread coordination.Covered: OOP, Concurrency, Design patterns, Memory management
3Managerial roundHiring managerRoughly fifty minutes: spiral tree traversal with a push to use one stack instead of two, recursively removing adjacent duplicate characters with an optimisation hint, string rotation checking, polymorphism types and building an immutable class.Covered: Trees, Arrays & strings, OOP
4Director roundFinalSpiral printing of a rectangular matrix, maximum interval overlap, enumerating ways a Java program can crash and the exception each throws, and reasoning about output of a reference-reassignment snippet.Covered: Arrays & strings, Data structures & algorithms, Debugging, OOP

Member of Technical Staff 1 (Adobe for Women)

Received an offer

Experienced. 5 rounds. Shared by Anonymous on gfg, 2025-07-15

1Online coding testOnline assessmentTwo hours with fifteen aptitude MCQs and two coding questions, run through a third-party partner. Candidates already placed at high-paying firms skipped straight to interviews.Covered: Aptitude, Data structures & algorithms
2Technical interviewTechnicalThe longest round at eighty to ninety minutes and explicitly used to eliminate most candidates. Covered a house-robber DP with pseudo code, a next-greater-element variant fully coded, external sorting of a file larger than RAM, timing a spreading process across a tree, and a large phone-directory search design where follow-ups pushed towards indexed lookup structures. Ended with OS and OOP theory.Covered: Dynamic programming, Stacks and queues, Trees, Operating systems, OOP
3Technical interviewTechnicalA further face-to-face elimination round at the Noida office, scored equally on logic, coding, data structures and operating systems.Covered: Data structures & algorithms, Operating systems
4Technical interviewTechnicalThe last technical elimination round on the same day, same weighting across logic, coding, DS and OS.Covered: Data structures & algorithms, Operating systems
5HR roundBehavioralA telephonic HR conversation after the technical rounds.Covered: Behavioral

Member of Technical Staff 2

Received an offer

Experienced. 7 rounds. Shared by Anonymous on gfg, 2025-07-12

1Online assessmentOnline assessmentSeventy-five minutes for twenty-two questions: fifteen logical-reasoning items, five C++ questions and two coding problems on tallying votes and on ordered substring selection.Covered: Aptitude, Data structures & algorithms, OOP
2Technical interviewTechnicalK-largest elements, running median over a stream, and a word-ladder style shortest transformation using a dictionary.Covered: Heaps, Graphs, Data structures & algorithms
3Technical interviewTechnicalThe circular house-robber variant and its linear form, plus computing the minimum number of meeting rooms from meeting intervals.Covered: Dynamic programming, Greedy, Arrays & strings
4Technical interviewTechnicalSystems-flavoured C: dynamic one- and two-dimensional array allocation with single and double pointers, implementing memcpy and strcmp, a discussion of threads, locks, deadlocks and endianness, and spiral matrix printing.Covered: Memory management, Concurrency, Arrays & strings
5Technical interviewTechnicalTwo open-ended modelling problems: whether a paragraph can be spelled from a set of lettered cubes, with a mirror-letter twist, and whether a road can be crossed given circular potholes described by centre and radius.Covered: Data structures & algorithms, Puzzles, Geometry
6Managerial roundHiring managerDesigning an elevator plus its dispatch algorithm, fitting a binary search tree into a fixed hundred-byte arena, handling the resulting internal fragmentation after deletions, and optimising a case study drawn from the manager's own team.Covered: Low-level design, Memory management, Case study
7Director roundFinalReasoning about two processes touching the same raw address and why the second fails, a walk through paging, address translation and thrashing, and search/insert/delete on a sorted two-dimensional array. The offer call came about ten days later.Covered: Operating systems, Debugging, Data structures & algorithms

Computer Scientist (Photoshop team)

Outcome not shared

Experienced. 4 rounds. Shared by siri_vipes on gfg, 2025-07-23

1Technical interviewTechnicalPrinting ancestors in a binary tree, finding the intersection of two linked lists, a factory-pattern question, C++ smart pointers, and a code-hygiene question about resetting global state across many return paths.Covered: Trees, Linked lists, Design patterns, OOP
2Technical interviewTechnicalDynamic allocation and deallocation of a two-dimensional array, iterative pre-order traversal, reversing a linked list, and C++ virtual and override semantics.Covered: Memory management, Trees, Linked lists, OOP
3Hiring managerHiring managerDesigning a thread-safe chat box in C++ with mutexes and condition variables, plus product-adjacent questions on LRU caching and image scaling and translation, reflecting the Photoshop team the candidate was interviewing for.Covered: Low-level design, Concurrency, Domain knowledge
4Director roundFinalMotivation and career questions - biggest achievement, why leaving, how they keep current - mixed with multithreading and design-pattern theory.Covered: Behavioral, Past projects, Concurrency, Design patterns

Software engineer

Received an offer

Experienced. 5 rounds. Shared by Anonymous on gfg, 2025-07-23

1Online assessmentOnline assessmentTwo forty-five minute sections on HackerRank: an objective aptitude test and a language test in C/C++ or Java mixing objective output questions with short coding tasks such as base conversion and generating a unique number set.Covered: Aptitude, Data structures & algorithms, Debugging
2Technical interviewTechnicalPalindromic substring enumeration, deadlock and virtual-memory theory followed by coding a virtual-memory scheme, and a diagnosis scenario about a browser-cache-database path whose latency jumped after a bug fix.Covered: Arrays & strings, Operating systems, Debugging, Scalability
3Technical interviewTechnicalBase conversion, then generalising and coding a concentric-square matrix pattern, then an open conversation about Adobe's own products and Creative Cloud.Covered: Arrays & strings, Domain knowledge
4Technical interviewTechnicalTwo classic optimisation puzzles, zig-zag level order traversal, loop detection and removal in a linked list, and Windows internals questions on the hosts file, the loopback address, the registry and 32- versus 64-bit differences.Covered: Puzzles, Trees, Linked lists, Operating systems
5Senior interviewFinalWith the most senior interviewer: a project deep dive on practical usage, then open-ended scenario questions such as debugging a dead wireless keyboard, how to verify a blur effect really applied to an image, and proposing missing features for consumer apps.Covered: Past projects, Product sense, Customer scenarios

Computer Scientist 2 (Frontend)

Outcome not shared

Experienced. 4 rounds. Shared by Abhishek Agarwal (Medium) on blog, 2025-04-21

1Data structures & algorithmsTechnicalResume and performance-optimisation discussion, a deep dive on linked-list use cases and LRU cache, and which sorting algorithm suits which scenario, then two array problems with heavy emphasis on complexity.Covered: Data structures & algorithms, Linked lists, Sorting, Resume deep-dive
2Data structures & algorithmsTechnicalTwo more standard algorithm problems: grouping anagrams and a stack-simulation collision problem.Covered: Arrays & strings, Stacks and queues
3Advanced JavaScriptTechnicalCritical rendering path, React memoisation hooks and the diffing algorithm, a prototypal-inheritance snippet, and building a task runner that executes promises in batches mixing parallel and sequential resolution.Covered: JavaScript, Browser rendering, React, Concurrency
4High level designSystem designDesigning a file-directory system, with the discussion pushed into component structure, API contracts, scalability, performance and list virtualisation.Covered: System design, API design, Scalability

Member of Technical Staff 2

Outcome not shared

Experienced. 4 rounds. Shared by LeetCode Discuss contributor on blog, 2025-05-27

1Problem solvingTechnicalTwo problems in a single-day hiring drive: counting sentence variants formed by anagram substitution, and finding the centroid nodes of a tree modelled as a company reporting hierarchy. The next-round invitation arrived within ten minutes.Covered: Arrays & strings, Trees, Graphs
2Problem solvingTechnicalA repeat of the tree-centroid problem with a complexity target, plus a top-k frequent elements problem framed as an e-commerce recommendation task.Covered: Trees, Heaps, Data structures & algorithms
3Low level designLow-level designDesigning a notification service that fans out to SMS, WhatsApp and push channels, covering design-pattern choice, class-level structure, a diagram, and how user interaction with notifications would be tracked.Covered: Low-level design, Design patterns, OOP
4Hiring managerHiring managerMicroservices-versus-monolith justification for the candidate's own architecture, a disagreement-with-management STAR question, and an unexpected object-modelling exercise: model a water bottle using encapsulation and inheritance.Covered: Behavioral, Conflict handling, OOP, Low-level design

Member of Technical Staff 2 (Frontend)

Received an offer

Experienced. 5 rounds. Shared by LeetCode Discuss contributor on blog

1Technical interviewTechnicalJavaScript fundamentals probed through scenarios rather than definitions - event loop behaviour, closures - plus React basics and two algorithm problems on trees and array manipulation.Covered: JavaScript, React, Trees, Arrays & strings
2Technical interviewTechnicalHow cache invalidation works in the candidate's product and how it is served to millions of users end to end from deployment to device, then frontend performance optimisations used in practice, then a medium tree problem.Covered: Scalability, Caching, Trees
3Hiring managerHiring managerA project the candidate was proudest of and why, then two coded problems: bottom view of a binary tree from scratch and a binary-search-on-answer problem.Covered: Past projects, Trees, Binary search
4Senior hiring managerHiring managerA React machine-coding exercise, a spatial reasoning puzzle about cutting and painting a cube, and one more medium tree problem.Covered: React, Puzzles, Trees
5Design and architectureSystem designNot a generic design-a-product round: the candidate had to draw the high-level design of their own project and defend each decision, discuss avoiding a utility library and reimplement one of its functions, and print a Fibonacci sequence without storing values.Covered: System design, Past projects, API design

Member of Technical Staff 2 (release engineering)

Outcome not shared

Experienced. 4 rounds. Shared by LeetCode Discuss contributor on blog

1Technical interviewTechnicalAbout seventy minutes: running median with two heaps and an LRU cache, both pseudo code only, wrapped around broad theory on scaling, load balancers, CAP, locking, SQL versus NoSQL, normalisation and atomicity.Covered: Heaps, System design, DBMS, Operating systems, Concurrency
2Technical interviewTechnicalTwo fully coded and test-run problems, one a long constraint-heavy backtracking question, followed by experience-driven questions on CI/CD, build tooling, cloud, containers and streaming infrastructure.Covered: Backtracking, Data structures & algorithms, DevOps, Scalability
3Hiring managerHiring managerA grilling on ownership, end-to-end delivery, leadership and debugging, and the point at which the candidate learned the role was release-engineering focused. Then scheduling problems: minimising makespan across two workers, and handling job dependencies via topological ordering.Covered: Behavioral, Past projects, Greedy, Graphs
4Director roundFinalThe candidate cleared everything and was invited to a director round described as another hiring-manager-style conversation, but declined it after accepting a competing offer.Covered: Behavioral

Member of Technical Staff 2

Outcome not shared

Experienced. 1 round. Shared by Kajol Kumari (Medium) on blog, 2023-09-03

1DSA and algorithm discussionTechnicalAn hour opening with introductions and an overview of the candidate's current work and tech stack before moving into algorithm discussion. The remainder of the writeup sits behind Medium's member wall.Covered: Data structures & algorithms, Resume deep-dive

Computer Scientist

Received an offer

Experienced, 50 LPA, via HackerRank. 6 rounds. Shared by Shaurya Pratap Singh on youtube

1Recruiter screenPhone screenA recruiter reached out over a hiring platform and did a short call covering recent work at previous employers, then shared a coding assessment link.Covered: Resume deep-dive, Past projects
2Online coding assessmentOnline assessmentA 60-minute HackerRank test with two medium/medium-hard problems: implement a stack using two queues, and reverse a linked list in groups of k with the leftover-nodes edge case.Covered: Data structures & algorithms, Arrays & strings
3DSATechnicalA pure DSA round with a senior engineer on HackerRank requiring all test cases to pass: first non-repeating character in a stream, and a twisted variant of an LRU cache, followed by time and space complexity discussion.Covered: Data structures & algorithms, Arrays & strings
4DSA + LLDLow-level designDeep dig into a past project, then coding: flatten a multi-level linked list (recursive then required iterative-with-stack), and merge sorted arrays where using the STL priority queue was disallowed so the candidate had to implement their own heap.Covered: Data structures & algorithms, Low-level design, Past projects
5HLDSystem designWith a director, design an online flight booking system: services breakdown, functional and non-functional requirements, APIs, DB schema and type, indexing, caching, and seat-booking concurrency via application vs DB locking (pessimistic vs optimistic).Covered: System design, DBMS
6HLD + Hiring managerHiring managerA 20+ year ex-Amazon manager grilled a challenging past Amazon project, then asked to design a simplified Adobe PDF editor (edit history/versioning, concurrent editing, undo/redo), query optimization via sharding and caching, and behavioral questions on manager conflict and mentoring.Covered: System design, Past projects, Behavioral

QA / SDET

Received an offer

Experienced. 4 rounds. Shared by Komal Tech Simplified on youtube

1Technical round 1TechnicalWith a team lead, questions moving from Java (static keyword, exceptions, file handling) into Selenium framework specifics, expecting real-world framework-level answers rather than textbook definitions, plus a task to check whether a footer link opens by verifying its HTTP status.Covered: OOP, Domain knowledge
2Technical round 2 (advanced)TechnicalWith a manager, framework-oriented questions on TestNG lifecycle, API testing, SQL (e.g. second-highest salary), collections (List/Set/Map usage in a framework), synchronization/waits, and debugging approach for failing test cases.Covered: OOP, SQL, Domain knowledge
3Managerial + behavioralBehavioralWith a QA director, questions on QA process, ownership, prioritization under tight deadlines and weekend work, and analytical thinking.Covered: Behavioral, Domain knowledge
4HR discussionFinalNotice period, relocation, reason for switching, and salary expectation.Covered: Behavioral

Computer Scientist (IC track)

Received an offer

Experienced, 46 LPA, via LinkedIn. 5 rounds. Shared by Bosscoder Academy on youtube

1DSA + JavaTechnicalTwo interviewers, LeetCode-medium problems (bottom view of a binary tree, two-sum on arrays), Java specifics on static variables/classes/methods, and a discussion of monolith vs microservices trade-offs.Covered: Data structures & algorithms, Trees, Arrays & strings, OOP
2DSATechnicalMore LeetCode-medium problems (majority element, copy a linked list with random pointer) with all-approaches discussion, internals of HashMap and ConcurrentHashMap, and a networking question on what happens when you type a URL in the browser.Covered: Data structures & algorithms, Arrays & strings, Networking
3System designSystem designStarted from past experience, then design a URL shortener focusing on scalability and availability, plus design patterns (factory), memory management, interface vs abstract class, and SOLID principles.Covered: System design, OOP, Past projects
4Hiring managerHiring managerRoughly 70-75 minutes on a chosen best project (approach, difficulties, contribution, impact), logging/telemetry and logger design, sync vs async programming and queueing, plus leadership questions on conflict resolution and reason for change.Covered: Past projects, System design, Leadership Principles
5Senior directorPanelDirector-level discussion of projects and motivation, technology questions (service discovery, horizontal vs vertical scaling, handling production issues), behavioral questions, and a math/estimation puzzle about remaining space of a ball in a room.Covered: Past projects, System design, Behavioral

Software Engineer Intern

Received an offer

Internship, Pune, India. 2 rounds. Shared by Ashish Kumar on youtube

1Online testOnline assessmentA test (via Adobe's She Codes program) covering DSA, aptitude, mathematics and core subjects, at medium difficulty.Covered: Data structures & algorithms, Arrays & strings, Domain knowledge
2Technical interviewTechnicalA ~50-60 minute DSA-only round: a warm-up on computing time/space complexity of a geometric-progression algorithm, then one medium array problem on permutations and combinations solved on a Google Doc, with think-aloud, dry run and edge-case discussion.Covered: Data structures & algorithms, Arrays & strings

Full Stack Developer

Received an offer

Experienced. 7 rounds. Shared by Ashish Kumar on youtube

1Recruiter screenPhone screenA ~15 minute call from a recruiter who found the profile on LinkedIn, discussing skills and prior experience before shortlisting for interviews.Covered: Resume deep-dive, Past projects
2Coding round 1TechnicalWith an SDE, three easy-to-medium coding questions based on arrays and stack.Covered: Data structures & algorithms, Arrays & strings
3Coding round 2TechnicalSimilar to round one with two more coding questions. Interviewers were friendly and encouraged thinking out loud.Covered: Data structures & algorithms
4Design round (backend)System designA design question modeled on Adobe Acrobat Reader's document search functionality.Covered: System design
5Front-end roundTechnicalWith a CS1, discussion of previous projects plus React questions and live coding a small React project on a CodeSandbox link.Covered: Past projects, Domain knowledge
6Hiring manager roundHiring managerA ~1.5 hour discussion focused entirely on previous projects and experience, with leadership-style questions. The manager shared positive feedback on the spot.Covered: Past projects, Leadership Principles
7Director roundPanelAbout the first half hour on leadership/managerial questions (conflict handling, why Adobe, whether you would leave for Google), then one coding question on lexicographic permutations of an array with a follow-up modification.Covered: Leadership Principles, Behavioral, Arrays & strings

Adobe interview questions

How the loop works

Interview experiences at Adobe

Role not stated

Software Engineer

Software engineering intern

Product intern

SDE intern

Product intern

SDE intern

Product intern

Software engineering intern

Member of Technical Staff 1

Computer Scientist 1

Software engineer (4 years experience)

Member of Technical Staff 1 (Adobe for Women)

Member of Technical Staff 2

Computer Scientist (Photoshop team)

Software engineer

Computer Scientist 2 (Frontend)

Member of Technical Staff 2

Member of Technical Staff 2 (Frontend)

Member of Technical Staff 2 (release engineering)

Member of Technical Staff 2

Computer Scientist

QA / SDET

Computer Scientist (IC track)

Software Engineer Intern

Full Stack Developer

What Adobe is hiring for now

Most-posted roles

Top locations

Open roles at Adobe

Adobe interviews: FAQ