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 8 problems of 26
- #16mediumfrequently asked
16. Rotate Image
Rotate an n×n matrix 90 degrees clockwise in-place. Adobe is a graphics and imaging company — in-place 2D array transformations are a core competency that appears directly in image rotation, canvas transforms, and pixel buffer manipulation across Photoshop, Lightroom, and Illustrator.
- #17mediumfrequently asked
17. Spiral Matrix
Return all elements of an m×n matrix in spiral order. Adobe's heavy focus on 2D array manipulation and image-buffer traversal makes this a recurring interview problem — spiral traversal is a canonical test of boundary-shrinking logic for pixel scan patterns.
- #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.
- #19mediumfrequently asked
19. Merge Intervals
Given a collection of intervals, merge all overlapping intervals. Adobe uses interval merging extensively in creative applications — timeline editing in Premiere Pro, selection ranges in Photoshop, and layer time spans all require efficient overlap detection and merging.
- #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.
- #21mediumfrequently asked
21. Word Search
Determine if a word exists in an m×n character grid where letters must be adjacent horizontally or vertically. Adobe uses this as a signature 2D DFS/backtracking problem — the grid-search pattern is directly applicable to font glyph shape recognition, texture atlas lookups, and region-growing algorithms in image segmentation.
- #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.
- #23mediumfrequently asked
23. Validate Binary Search Tree
Determine if a binary tree is a valid BST. Adobe asks this to test whether candidates understand the global invariant (not just local parent-child comparisons) — a level of rigor that mirrors validating hierarchical constraint systems in document structure and layout engines.
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.