Bit Manipulation Questions at American Express: What to Expect

Bit manipulation questions appear in about 12.5% of American Express's technical interview problem set—3 out of their 24 core patterns. While not the most frequent topic, its presence signals an expectation for engineers to understand low-level data representation and efficient computation, which is critical in financial systems handling high-volume transactions and data integrity checks. Mastering these problems demonstrates precision, familiarity with computer science fundamentals, and the ability to write performant code—all valued traits for roles involving payments infrastructure, security, and data processing.

What to Expect — Types of Problems

American Express typically focuses on practical, medium-difficulty bit manipulation problems rather than obscure tricks. You can expect two main categories:

1. Single Number & Frequency Problems: These test your ability to use XOR or masking to find unique or duplicate elements in a sequence. A classic example is finding the single non-duplicate integer in an array where every other number appears twice.
2. Bit Counting & Property Checks: Problems that require counting set bits (1s), checking power-of-two status, or toggling specific bits. These often relate to optimizing state checks or flags, a common scenario in systems programming.

You are unlikely to encounter highly complex bit puzzles. The goal is to assess whether you can apply core operators (&, |, ^, ~, <<, >>) to write clean, efficient solutions.

How to Prepare — Study Tips with One Code Example

Focus on internalizing a handful of key patterns. Memorizing dozens of tricks is less effective than deeply understanding a few. Practice by writing solutions from scratch and manually tracing the bit values through each operation.

A fundamental pattern is using XOR to cancel duplicates. The key property is that a ^ a = 0 and a ^ 0 = a. This allows you to find a unique element in linear time without extra space.

def single_number(nums):
    result = 0
    for num in nums:
        result ^= num
    return result

# Example: [4, 1, 2, 1, 2]
# 0 ^ 4 = 4, 4 ^ 1 = 5, 5 ^ 2 = 7, 7 ^ 1 = 6, 6 ^ 2 = 4

Recommended Practice Order

Build your competency stepwise. Start with the foundational operations before tackling combined concepts.

1. Basic Operations: Practice toggling, setting, clearing, and checking individual bits using masks.
2. Core Patterns: Master the XOR duplicate cancellation (shown above), Brian Kernighan's algorithm for counting set bits (n & (n-1)), and the power-of-two check (n & (n-1) == 0).
3. Classic Problems: Solve "Single Number," "Number of 1 Bits," "Missing Number," and "Reverse Bits."
4. Integrated Problems: Finally, attempt problems where bit manipulation is one tool among others, such as "Subsets" (using bitmasks for generation) or problems involving bitwise sums.

This structured approach ensures you build from first principles to confident application.

Practice Bit Manipulation at American Express