Adobe Coding Interview Questions
26 Adobe coding interview problems with full optimal solutions — 15 easy, 8 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Adobe interviewer values, and a FAQ section.
Showing 9 problems of 26
- #5easysometimes asked
5. Remove Element
Given an array and a value, remove every occurrence in-place and return the new length. Adobe asks this to test in-place mutation discipline that maps directly to pixel-mask filtering in image-editor pipelines.
- #7easysometimes asked
7. Plus One
Given a non-empty array of digits representing a non-negative integer, increment it by one. Adobe uses this to test carry-propagation logic — the same pattern that drives big-integer arithmetic in PDF page-number generation and version counters.
- #10easysometimes asked
10. Same Tree
Given two binary trees, decide if they are structurally identical and have the same node values. Adobe uses this to test whether you can write clean structural recursion — the foundation for diffing two versions of a document tree in collaborative editing.
- #11easysometimes asked
11. Symmetric Tree
Determine whether a binary tree is a mirror of itself. Adobe asks this to test mirror-recursion intuition — the same logic that flips paths and shapes across the vertical axis in vector graphics editors.
- #14easysometimes asked
14. Pascal's Triangle
Generate the first numRows rows of Pascal's triangle as a list of lists. Adobe uses this to assess 2D array construction skills and the candidate's ability to build each row from the previous one — a pattern that mirrors incremental rendering pipelines.
- #18mediumsometimes asked
18. Jump Game
Given an array where each element is the maximum jump length from that position, determine if you can reach the last index from index 0. Adobe uses this to test greedy reasoning and forward-reachability tracking — a pattern that appears in animation timeline reachability and workflow-state feasibility checks.
- #20mediumsometimes asked
20. Unique Paths
Count the number of unique paths in an m×n grid from the top-left to the bottom-right moving only right or down. Adobe uses this to assess dynamic programming fluency and the candidate's ability to reduce a combinatorial problem to a grid DP — skills that transfer to rendering pipeline optimization and layout engine design.
- #22mediumsometimes asked
22. Decode Ways
Count the number of ways to decode a numeric string where '1'-'26' map to 'A'-'Z'. Adobe tests this problem to assess DP string-parsing skills and careful handling of edge cases like leading zeros — patterns central to font encoding, barcode parsing, and document format decoding in Creative Cloud.
- #26hardsometimes asked
26. Maximal Rectangle
Find the largest rectangle containing only 1s in a binary matrix. Adobe uses this as a synthesis problem that combines 2D array traversal with the histogram stack algorithm — directly applicable to bounding-box detection in image segmentation and selection-region optimization in Photoshop.
Related interview-prep guides
Tavus.io Alternatives in 2026: 6 Tools Compared (AI Interview Avatars + Candidate Help)
Tavus.io builds AI-generated personalized video and AI interview avatars for hiring teams. The 'tavus io alternative' search isn't usually about replacing Tavus on the recruiter side. It's candidates discovering that Tavus is built for the wrong side of the table and looking for a tool that helps them prep for or pass an AI-avatar interview. Here's the honest comparison: 6 alternatives, what each one is actually good at, and the decision tree by what you're trying to do.