Adobe Frontend Round 1 Questions: 10 Experiences (Part 9 of 12)

Shared by janebeingjane ·
Company
Adobe
Reports
10 interview reports
Level
Full-time
Stages
Phone screen

Adobe frontend round 1 reports from 2025–2026 mix a DSA problem with core JavaScript: closures, the event loop and polyfills.

At a glance

  • Process: one technical round, often called "DSA and JavaScript" (52, 53, 54, 55). Three candidates had rounds back to back on one day (55, 59 and 52's later rounds). Later rounds were React machine coding (57, 61), frontend system design, a hiring manager and a director.
  • Asked recently: JavaScript fundamentals in 6 of 10 (52, 53, 57, 58, 60, 61), with closures and the event loop named in 3 (52, 57, 61). DSA came up in 6 (52, 53, 54, 55, 58, 60). Hands-on UI tasks came up in 5 (54 flexbox, 56 React with TDD, 57 debounce and flatten, 58 a reduce polyfill, 59 an HTML and CSS figure).
  • Difficulty: candidate 54 didn't expect CSS and struggled with it; 59's HTML and CSS round took eight minutes. Three got offers (52, 57, 61); two of those interviewed for CS-1 and were offered MTS-2 (57, 61).
  • Practise first: Debounced Call Times, Flatten a Nested Object Into Dot Keys, Biggest Number From Gluing Numbers Together and Count Pairs with Absolute Difference K.

Coverage: 10 frontend reports from Apr 2025 to Jul 2026: MTS-2 (52), Computer Scientist 1 (53, 57, 61), Computer Scientist with no level (54), Senior Computer Scientist (55), Computer Scientist 2 (58, 60), SDE-3 by the candidate's label (59) and a U.S. principal engineer whose first screen was frontend (56). The series covers 69 experienced-hire reports, first technical round only.

In this series

What came up

JavaScript knowledge was tested in most rounds, usually next to one or two algorithm problems.

Topic Reports Last seen
JavaScript fundamentals 6 of 10 Jul 2026 (report date)
Data structures and algorithms 6 of 10 Jul 2026 (report date)
UI coding (CSS, React, utilities) 5 of 10 May 2026
Closures and the event loop 3 of 10 Jul 2026 (report date)
Résumé, projects and performance work 3 of 10 May 2026
TypeScript and tooling 1 of 10 May 2026
Prototype chain 1 of 10 Jun 2025 (report date)
Web security 1 of 10 Jun 2025 (report date)

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Count Subsets with Sum K 1: 52 Jul 2026 (report date)
Count Pairs with Absolute Difference K (LeetCode 2006 family) 1: 52 Jul 2026 (report date)
Biggest Number From Gluing Numbers Together (LeetCode 179) 1: 53 May 2026 (report date)
Pick the set of trades that gives the minimum value (few details) 1: 55 May 2026
Binary Tree Level-Order Traversal by Levels (with an undisclosed twist) 1: 58 May 2025 (report date)
Longest Run of Consecutive Values (LeetCode 128) 1: 60 Apr 2025 (report date)
Every Index Pair That Sums to a Target (two-sum variant, duplicates allowed) 1: 60 Apr 2025 (report date)

Frontend / UI Coding

Question Reports Last seen
Build a CSS layout with flexbox (layout not shared) 1: 54 May 2026
Build a small React app with test-driven development 1: 56 Sep 2025
Debounced Call Times (write a debounce function) 1: 57 Jul 2025 (report date)
Flatten a Nested Object Into Dot Keys 1: 57 Jul 2025 (report date)
Compose async functions with chaining (composeAsync) 1: 57 Jul 2025 (report date)
Polyfill for Array.prototype.reduce 1: 58 May 2025 (report date)
Recreate a simple figure in plain HTML and CSS 1: 59 Apr 2025 (report date)

Language and CS Fundamentals

Question Reports Last seen
JavaScript core: closures, the event loop and this binding 2: 57, 61 Jul 2025 (report date)
JavaScript output question: promise and setTimeout order (event loop) 1: 52 Jul 2026 (report date)
TypeScript type predicates 1: 55 May 2026
Nx monorepo tooling and current projects 1: 55 May 2026
Memory leaks in large React apps, garbage collection, retrying flaky APIs 1: 57 Jul 2025 (report date)
Linked-list use cases, an LRU cache discussion, choosing a sorting algorithm 1: 60 Apr 2025 (report date)

10 frontend round 1 reports

52: MTS-2 frontend: two counting problems and an event-loop puzzle

Report date: Jul 30, 2026 · Role: MTS-2, frontend (JavaScript and React) · Experience: 3 years · Result: Offer

Before the first technical round: An HR call covered the candidate's stack, daily work, reasons for leaving, pay and notice period.

Round 1: Data structures and JavaScript (first technical round)

  1. Another MTS-2 ran the round. The first task was to count the subsets of an array that add up to k. The candidate talked through brute force, moved to dynamic programming, and coded it in C++.
  2. Next came counting pairs whose absolute difference is exactly k (LC 2006 family). A hash map did the job, again in C++.
  3. The round closed with a JavaScript output question: predict the print order of code that mixes promises and setTimeout. It tests the microtask and macrotask queues.
  4. They passed.

After round 1: Round 2 (data structures and React) had summing the even nodes on the path between two nodes of an array-indexed binary tree, a check for numbers with exactly three divisors, and a debounced typeahead in React. Round 3 mixed React internals with a pub/sub exercise for adding books from anywhere in an app, plus a question on how they use AI in daily work and which Claude skill they would write. Round 4 was behavioral, including a production issue they faced, plus a design for a PDF search box; it was repeated for another team after the first position closed. Round 5 brought a stakeholder pushing to halve the timeline, ways to control this, counting occurrences in a sorted array with hand-written lower and upper bounds, and a trie's add-word method. The candidate got the offer.


53: CS-1 frontend: largest number and JavaScript basics

Report date: May 7, 2026 · Role: Computer Scientist 1, frontend · Experience: 4 years · Result: Rejected after the final round

Round 1: JavaScript code and fundamentals (first technical round)

  1. A binary search question. The candidate didn't describe it.
  2. Arrange numbers so their concatenation forms the largest number (LC 179).
  3. JavaScript questions, including how try/catch behaves. No more detail was given.
  4. They cleared the round.

After round 1: Round 2 asked for all permutations of an array, plus debounce and throttle. The hiring manager round discussed past work and how to split a React single-page app by route. The director round went deep on UI performance, service workers and a backend-for-frontend layer, and ended in a rejection.


54: Computer Scientist frontend: a flexbox layout and a two-part problem

Interview date: about May 2026 (about six months before the Nov 2, 2026 report) · Role: Computer Scientist, frontend (referred) · Result: Rejected after this round

Initial round: DSA and JavaScript (first technical round)

  1. A very senior Computer Scientist ran it.
  2. A CSS layout to build with flexbox and related properties. The exact layout wasn't shared. The candidate hadn't expected CSS in this round and struggled with it.
  3. An unusual DSA problem with two levels to clear. The problem itself wasn't described. The interviewer gave hints, and the candidate needed them.
  4. The hints felt encouraging, but a rejection came after this round.

55: Senior CS frontend on a drive day: trades, type predicates, Nx

Interview date: May 2026 · Role: Senior Computer Scientist, frontend · Experience: 10 years · Location: Bengaluru, India

Round 1: Data structures, algorithms and coding basics (first technical round)

  1. This was a hiring-drive day with two rounds back to back. A request to reschedule was turned down.
  2. The candidate listed the questions without tying each one to a round, so these are probably from this round. The coding question: find the set of trades that gives the minimum value. No more detail was given.
  3. A question on TypeScript type predicates.
  4. Questions on Nx, the monorepo tool, and on current projects.
  5. The interviewer was patient and the questions felt relevant. The candidate thought it went well.

After round 1: Round 2 was billed as a frontend round but turned into system design: a real-time collaborative text editor that shifted into a collaborative drawing tool, with dropped items coming back into scope. The candidate found the expectations unclear. No result was reported.


56: Principal engineer: a front-end screen with React and TDD

Interview date: Sep 26, 2025 · Role: Principal Software Engineer (the first screen was front end) · Location: United States · Result: No offer

Initial screening: front end (first technical round)

  1. Basic front-end concepts. No specific questions were shared.
  2. Build a small React application using test-driven development.
  3. After the screen the candidate heard nothing back and got no feedback.

57: CS-1 frontend, offered MTS-2: debounce, flatten, async compose

Report date: Jul 9, 2025 · Role: Interviewed for Computer Scientist 1 (frontend); offered MTS-2 · Experience: 2 years 10 months · Result: Offer at MTS-2, accepted

Round 1: JavaScript fundamentals (first technical round)

  1. Core JavaScript: closures, the event loop, async behavior and how this gets bound.
  2. Write a debounce function.
  3. Flatten a deeply nested object into dot-separated keys.
  4. Write composeAsync, which chains async functions together.
  5. Memory leaks in large React apps, garbage collection, and how to retry calls to a flaky API.
  6. Feedback was positive.

After round 1: Round 2 was a React build: a nested comment section with replies, likes, auto-saved drafts and keyboard access, then an infinite-scroll hook with cursor paging and memoization questions. Round 3 designed a content dashboard with live updates and access control. The manager round asked for search in a sorted 2D matrix and grid paths with at most one obstacle removed. The director round had reversing a linked list in groups of k and a spoken palindrome-partitioning question. The candidate was offered MTS-2 and accepted.


58: CS-2 frontend: level order with a twist and a reduce polyfill

Report date: May 12, 2025 · Role: Computer Scientist 2, frontend · Experience: 8+ years · Location: Bengaluru, India · Result: Not selected

R1: Coding (first technical round)

  1. Binary tree level-order traversal, grouped by level, with a twist the candidate didn't describe.
  2. Write a polyfill for Array.prototype.reduce.
  3. A deep dive into their UI stack and its trade-offs, how they improved performance, and in-depth JavaScript questions.
  4. Feedback for this round was positive.

After round 1: Round 2 asked them to move heavy input calculations into a Web Worker so a clock on the page wouldn't freeze, plus promises versus async/await and list virtualization. Round 3 was a design-and-code round for multiplayer Snakes and Ladders. The candidate felt rounds 2 and 3 went badly and was not selected.


59: SDE-3 frontend: an eight-minute HTML and CSS round

Report date: Apr 20, 2025 · Role: SDE-3, frontend (the candidate's label; the Adobe title wasn't given) · Experience: 4+ years · Location: Noida, India · Result: Rejected after all rounds

Before the first technical round: A recruiter reached out by email.

Round 1: HTML and CSS (first technical round)

  1. The rounds were virtual and back to back on the same day.
  2. Recreate a simple figure using only HTML and CSS. The candidate finished fast; the round took about 8 minutes.

After round 1: The DSA round asked for a stack that can delete an element at any position in O(1); a doubly linked list solved it in time. The managerial round covered the resume and the puzzle of finding the 3 fastest horses with a limited number of race tracks. The candidate was rejected.


60: CS-2 frontend: linked lists, LRU talk and two array problems

Interview date: 2025 (report date Apr 21, 2025) · Role: Computer Scientist 2, frontend

Round 1: Data structures and algorithms (first technical round)

  1. The round leaned hard on time and space complexity.
  2. It opened with the resume and the candidate's performance work.
  3. Theory: where linked lists are useful, a long discussion of the LRU cache, and which sorting algorithm fits which case.
  4. Find the longest run of consecutive values in an array (LC 128).
  5. A two-sum variant: return every index pair that adds up to the target, with duplicate values allowed.

After round 1: Round 2 had Group Anagrams and Asteroid Collision. Round 3 covered the critical rendering path, React hooks and diffing, a prototype snippet, and a task runner that resolves promises in batches. Round 4 designed a file-directory UI. The candidate mentioned six rounds; only four were described, and no result was given.


61: CS-1 frontend, offered MTS-2: closure and prototype problems

Interview date: 2025 (report date Jun 30, 2025) · Role: Frontend engineer; interviewed for Computer Scientist 1, offered MTS-2 · Experience: 2 years 11 months · Location: India · Result: Offer at MTS-2

Round 1: JavaScript fundamentals and coding (first technical round)

  1. Questions on closures, this, call/apply/bind and the event loop.
  2. A coding problem built on closures. The exact task wasn't shared.
  3. A second problem about the prototype chain, also without details.
  4. Web security and frontend performance tuning.
  5. The round went well.

After round 1: Round 2 (45 minutes) was React machine coding: a custom pagination hook with a cursor and page size, plus infinite scroll that loads the next page at the bottom. Round 3 designed a config-driven app with a backend-for-frontend layer and caching, then a social feed page. The manager asked for search in a sorted 2D matrix, then replacing the found value while keeping the matrix sorted. The director asked for reversing a linked list in groups of k, in JavaScript. The offer came at MTS-2 instead of CS-1.


Patterns across the reports

  1. Closures and the event loop. Three rounds named them directly (52's promise and setTimeout order, 57 and 61's core JavaScript), and 61 also had a coding problem built on closures.
  2. Offered a level below the one applied for. Two CS-1 frontend candidates were offered MTS-2 instead (57, 61).

Common questions

What JavaScript questions does Adobe ask frontend candidates?

Closures, this binding and the event loop (52, 57, 61), call, apply and bind (61), try/catch (53), TypeScript type predicates (55), plus polyfills and helpers such as reduce (58), debounce, flatten and composeAsync (57).

Is there DSA in the Adobe frontend interview?

Yes, in six of ten first rounds: subset and pair counting (52), largest concatenated number (53), level-order traversal (58), longest consecutive run and a two-sum variant (60), plus unnamed problems in 54 and 55.

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

Next in this seriesAdobe Android Engineer Round 1: 3 Experiences (Part 10 of 12)
0 total reactions. Your reactions: none.

Comments

0

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