Adobe Software Engineer interview questions

14 Software Engineers have shared notes from their Adobe interviews, with the questions they were asked in each round. That is 56% of the 25 Adobe interview notes on Screna AI.

14 Software Engineer interview notes

Adobe·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Adobe system design round for a software engineer role. One question, but it kept branching into harder territory every time I thought I had a handle on it. Not a bad experience, just dense.
  • Design an API that returns a unique random integer from a range of 1 to 33 trillion, guaranteed never to repeat, at 300,000 requests per second. Walk through your data structure choices, how you'd partition the keyspace across nodes, how you'd ensure durability and exactly-once issuance, how you'd handle coordination and leader election, and how you'd extend the design if the keyspace doubled to 66 trillion.

“I started with a bitmap and immediately realized I was describing something that would need terabytes of RAM to hold in memory.”

View Post

Adobe·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Adobe SWE interview that leaned heavily on operational depth. Three big questions, all behavioral but with real technical teeth. The kind of round where you can't just recite a story without actually knowing what you're talking about.
  • Walk me through the most complex project you've worked on. What made it complex, what problems came up, and how did you get through them?
  • Describe the most urgent on-call incident you've personally handled. How did you triage, limit the damage, communicate with stakeholders, and follow up after?
  • Share an experience that shows you're a good fit for a role focused on operational excellence.

“I spent too long on the setup and not enough on what I actually did.”

View Post

Adobe·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Adobe SWE behavioral round that's basically a deep dive through your resume. They don't just skim it, they pick a project and start drilling, so you'd better know every decision you made inside and out.
  • Walk me through a significant project on your resume. What was the problem, what did you specifically contribute, and what technical decisions did you make?
  • What would you do differently on that project if you could go back?
  • For a role or project on your resume, what was the outcome and how did you measure success?

“This is the core of the whole round.”

View Post

Adobe·Software Engineer·Technical Phone Screen

Jun 2026
Adobe system design phone screen that went deep on Linux internals. One question, but it had a lot of moving parts and I definitely underestimated how much they'd want on the inode side of things.
  • A process in one terminal is continuously writing to log.txt. Another terminal is running `tail -f log.txt`. You delete the file from a third terminal with `rm log.txt`. Walk through what happens to: the writer's file descriptor and ongoing writes, what the tailer sees, the directory entry and inode lifecycle, and when the disk space actually gets reclaimed. Also cover how `lsof | grep deleted` exposes the situation, and explain the discrepancy you'd see between `df` and `du` after this kind of delete.

“I knew the broad strokes: rm unlinks the directory entry but the inode stays alive while open file descriptors hold a reference.”

View Post

Adobe·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Adobe leadership rounds for a software engineer role, and I walked out pretty sure I'd bombed it. Two separate interviewers said upfront they weren't touching technical stuff and just wanted to know if they could trust me. Vague brief, vague feedback, and then a rejection.
  • How would you go about earning the trust of your manager and your team?

“I fumbled this pretty badly.”

View Post

Adobe·Software Engineer·Technical Phone Screen

May 2026
Adobe SWE interview with a classic array intersection problem. The question had a few layers to it and the follow-up caught me a bit flat-footed.
  • Given two sorted integer arrays, find their intersection. Walk through a two-pointer approach, explain how you'd handle duplicates (set vs multiset semantics), and compare it to a hash-set solution in terms of complexity.
  • Follow-up: if one array is much smaller than the other, how would you change your approach? Think about binary search.

“I jumped straight to two pointers which felt right, and the linear time part clicked pretty naturally.”

View Post

Adobe·Software Engineer·Technical Phone Screen

May 2026
Adobe SWE interview where the resume walkthrough was basically a trap door into a deep dive on everything you've ever touched. If it's on your resume, they will find the edge of what you know.
  • Walk me through your resume, and be ready to go deep on any technology, framework, or system you mention.

“This sounds like a warmup but it really isn't.”

View Post

Adobe·Software Engineer·Hiring Manager Screen

May 2026
Adobe hiring manager phone screen for a software engineer role, about 30 minutes, no coding involved. Pretty structured: HM talks about the team, you walk through your background for most of it, then they dig into your projects.
  • Walk me through your background and the most significant projects you've worked on.
  • Follow-up questions on the technical details of the projects you described.

“This is basically the whole interview.”

View Post

Adobe·Software Engineer·Technical Phone Screen

May 2026
Adobe SWE interview that leaned heavily into array problem variants. The core question was straightforward but the follow-ups kept coming and that's where things got interesting.
  • Given an unsorted integer array, find all duplicate numbers. Walk through different approaches and their trade-offs.
  • If all values in the array are bounded between 1 and 200, what additional approaches become viable? Compare bitmask, counting array, and in-place index marking.

“Started with hash-set, which they expected.”

View Post

Adobe·Software Engineer·Technical Phone Screen

May 2026
Adobe coding round, one problem, tree stuff. The question itself wasn't too bad once I figured out the pattern but getting there took longer than I'd like to admit.
  • Given the root of a binary tree, find the maximum path sum where a path can start and end at any node (not necessarily the root).

“I kept getting tripped up because I assumed the path had to go through the root.”

View Post