Math Questions at Adobe: What to Expect

Math questions appear in about 14% of Adobe's technical interview problems. While this is a smaller focus than core data structures, it's a consistent and high-stakes area. These problems test your analytical reasoning, ability to translate a word problem into logic, and comfort with fundamental computational concepts. Success here signals you can handle the algorithmic thinking required for graphics rendering, data analysis, and performance optimization—all core to Adobe's products.

What to Expect — Types of Problems

Adobe's math questions generally avoid advanced calculus or deep theoretical proofs. Instead, they focus on applied computational mathematics. Expect these categories:

1. Number Theory & Bit Manipulation: Problems involving prime numbers, divisibility, GCD/LCM, or direct bitwise operations. These test low-level understanding.
2. Probability & Combinatorics: Calculating odds, counting permutations/combinations, or simulating simple probabilistic scenarios.
3. Modular Arithmetic & Sequences: Questions about repeating patterns, clock arithmetic, or finding the nth term in a sequence.
4. Basic Geometry & Coordinate Math: Distance calculations, line intersections, or properties of simple shapes, often relevant to graphics or UI logic.
5. Mathematical Pattern Recognition: The most common type. You're given a problem description (e.g., "find the kth number divisible only by 3, 5, and 7") and must derive the efficient mathematical rule or formula before coding.

How to Prepare — Study Tips with One Code Example

Focus on understanding principles, not memorizing solutions. Review core concepts: prime sieves, GCD (Euclid's algorithm), modular exponentiation, and basic combinatorics formulas. Practice translating English descriptions into equations. For coding, efficiency is key—often the brute-force solution is too slow, and the real test is finding the mathematical shortcut.

A key pattern is using the Sieve of Eratosthenes for prime-related problems. Here is a standard implementation to find all primes up to a number n:

def count_primes(n):
    if n < 2:
        return 0
    is_prime = [True] * n
    is_prime[0] = is_prime[1] = False

    for i in range(2, int(n ** 0.5) + 1):
        if is_prime[i]:
            for j in range(i*i, n, i):
                is_prime[j] = False
    return sum(is_prime)

Recommended Practice Order

1. Start with foundational number problems: checking primes, GCD/LCM, palindrome numbers, and basic bit manipulation (count set bits).
2. Move to probability and combinatorics: simulate dice rolls, calculate ways to climb stairs (a classic DP problem with mathematical roots).
3. Tackle sequence and series problems: find missing numbers, analyze arithmetic/geometric progressions.
4. Finally, attempt Adobe's company-tagged "Math" questions on platforms like LeetCode. This exposes you to their specific style and difficulty.

Work through each problem by identifying the underlying rule first. Only write code once you've confirmed the mathematical approach.

Practice Math at Adobe