Math Questions at Media.net: What to Expect

Math questions at Media.net aren't about abstract theory—they're practical problem-solving tools for ad tech. Media.net builds complex systems for real-time bidding, ad targeting, and optimization algorithms. These systems require precise calculations for metrics like click-through rates, revenue per mille (RPM), budget pacing, and statistical forecasting. The five math questions in their 33-question interview assess your ability to translate real-world constraints into efficient, logical code. If you can't handle the math, you can't handle the core engineering problems.

What to Expect — Types of Problems

Expect combinatorics, probability, and modular arithmetic applied to practical scenarios. You won't solve integrals; you'll write code that counts, calculates odds, or sequences events under constraints.

1. Combinatorics & Counting: "Find the number of valid ad placements" or "Count unique user ID combinations under rules." These test systematic thinking.
2. Probability & Statistics: "Calculate the expected value of ad revenue given click probabilities" or "Simulate A/B test outcomes." Direct application to their business.
3. Modular Arithmetic & Number Theory: "Schedule ad rotations in cycles" or "Hash user IDs into buckets." Essential for distributed systems.
4. Optimization & Greedy Math: "Maximize revenue with budget caps" or "Minimize server load with constraints." Core to resource management.
5. Bit Manipulation & Efficient Math: "Check power-of-two for allocation" or "Compute fast modulo operations." Low-level performance matters.

How to Prepare — Study Tips with One Code Example

Focus on translating word problems into clean code. Practice these steps: 1) Restate the problem in your own words, 2) Identify the mathematical rule (combination formula, probability law, etc.), 3) Write brute-force logic first if needed, 4) Optimize with mathematical insights. Use Python for quick iteration, but be ready to implement in Java or JavaScript.

A common pattern is using the nCr (combinations) formula efficiently, often with modular arithmetic to avoid overflow. Here’s how to implement it using precomputed factorials with modulo (common in counting problems where results are large):

MOD = 10**9 + 7

class Combinatorics:
    def __init__(self, max_n):
        self.fact = [1] * (max_n + 1)
        self.inv_fact = [1] * (max_n + 1)
        for i in range(1, max_n + 1):
            self.fact[i] = self.fact[i-1] * i % MOD
        self.inv_fact[max_n] = pow(self.fact[max_n], MOD-2, MOD)
        for i in range(max_n-1, -1, -1):
            self.inv_fact[i] = self.inv_fact[i+1] * (i+1) % MOD

    def nCr(self, n, r):
        if r < 0 or r > n:
            return 0
        return self.fact[n] * self.inv_fact[r] % MOD * self.inv_fact[n-r] % MOD

Recommended Practice Order

1. Basics: Prime numbers, GCD/LCM, modular arithmetic, fast exponentiation.
2. Combinatorics: Permutations, combinations, inclusion-exclusion principle.
3. Probability: Expected value, conditional probability, basic distributions.
4. Optimization: Greedy proofs, linear programming intuition.
5. Media.net-specific: Practice problems tagged with "Media.net Math" on coding platforms—they often mirror actual interview questions.

Work through problems in this sequence, always coding your solutions. Time yourself; these questions are often part of a larger timed assessment.

Practice Math at Media.net