These are Algorithms 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 Algorithms concept questions
Compute x to the power n (say 2^31) in O(log n) multiplications. Walk through fast exponentiation and the negative-n case.
Asked in
Reverse the words in "the sky is blue" → "blue is sky the". Give the simple solution, then the in-place idea for a mutable character array.
Asked in
Adobe Algorithms applied & hands-on questions
Find the maximum PRODUCT of a contiguous subarray of [2, 3, -2, 4] and then [-2, 0, -1]. Why does Kadane's max-only tracking fail, and what fixes it?
Asked in
How to use this page: Adobe rarely asks something you've never seen — they ask a standard Algorithms concept and then push one level deeper ("why?", "what would you do if..."). Master the concept in the Algorithms course lessons, and the follow-up stops being scary.
Keep practising: Binary Search, Dynamic Programming, BFS & DFS and Patterns & Strategy cover what most Adobe Algorithms rounds test.