Math Questions at Agoda: What to Expect

Math questions appear in 7 out of 46 total problems in Agoda’s technical assessments. While this ratio may seem modest, these problems test a foundational skill: the ability to translate mathematical logic into clean, efficient code. At a data-driven travel platform like Agoda, math underpins pricing algorithms, discount calculations, analytics, and system optimizations. Success here demonstrates you can handle the quantitative reasoning required to scale a global business.

What to Expect — Types of Problems

Agoda’s math problems are practical and algorithmic. You won’t be solving abstract equations; instead, you’ll implement mathematical concepts to compute a result. Common themes include:

• Modular Arithmetic and Number Properties: Problems involving remainders, divisibility, or cycling through sequences. For example, calculating the day of the week after N days or finding numbers with specific modulo constraints.
• Combinatorics and Counting: Efficiently counting permutations, combinations, or arrangements under given rules, often requiring you to avoid brute-force solutions.
• Basic Probability and Statistics: Calculating expected values, odds, or simple statistical measures from a dataset.
• Numerical Simulation: Modeling a simple process (like a game or a physical system) step-by-step to arrive at a numerical answer.
• Optimization with Math: Using mathematical insight (like the properties of GCD/LCM or arithmetic series) to minimize time or resource usage in an algorithm.

The key is recognizing the underlying pattern to avoid unnecessary computation.

How to Prepare — Study Tips with One Code Example

Focus on mathematical reasoning, not advanced calculus. Review number theory (prime numbers, GCD/LCM, modulo), basic combinatorics (nCr formulas), and probability fundamentals. Practice translating word problems into precise computational steps.

A frequent pattern is using the GCD (Greatest Common Divisor) to simplify problems involving ratios, cycles, or dividing resources. The Euclidean algorithm is the efficient, standard approach.

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

# Example: Simplify a ratio 24:18 to its lowest terms
num1, num2 = 24, 18
divisor = gcd(num1, num2)
simplified = (num1 // divisor, num2 // divisor)
print(simplified)  # Output: (4, 3)

Recommended Practice Order

1. Master Fundamentals: Ensure you can code basic operations like GCD, LCM, prime checking, and modulo arithmetic from memory.
2. Solve Pattern Problems: Work on classic puzzles involving these fundamentals (e.g., counting divisible numbers, simulating dice rolls).
3. Apply to Scenarios: Practice Agoda-specific or similar platform problems that wrap these concepts in real-world contexts like pricing splits or scheduling cycles.
4. Optimize for Edge Cases: Consider large constraints—your solution must be efficient. If a brute-force loop seems necessary, a mathematical shortcut usually exists.

Practice Math at Agoda