These are Data Structures questions of the kind Adobe actually asks — the patterns reported from Adobe's AI-engineering rounds, where design trade-offs, scale and failure modes matter as much as definitions. Treat this page as a mock interview: say every answer out loud before revealing it. If one surprises you, the lesson behind it is linked at the bottom.
Adobe Data Structures concept questions
Implement two stacks in a single fixed array without wasting space. Why is the naive half-and-half split inferior?
Asked in
Given a stream of characters, print the first non-repeating character so far, after EVERY character arrives. Design the structure.
Asked in
Adobe Data Structures applied & hands-on questions
At a party of n people, a celebrity knows nobody, but everybody knows the celebrity. Given knows(a, b), find the celebrity in O(n) calls. (Naive: check all pairs, O(n²).)
Asked in
How to use this page: Adobe rarely asks something you've never seen — they ask a standard Data Structures concept and then push one level deeper ("why?", "what would you do if..."). Master the concept in the Data Structures course lessons, and the follow-up stops being scary.
Keep practising: Hash Tables, Linked Lists, Heaps and Choosing the Right Structure cover what most Adobe Data Structures rounds test.