Skip to content

American Express 2026 Pattern Details

Overview

This page collects American Express placement papers from 2026 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established American Express patterns and recent shifts.

American Express Aptitude Mock Quiz

Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.

Questions15
Time10 min

American Express exam pattern 2026

Section What shows up Prep focus
Aptitude / logical Quant, reasoning, sometimes verbal Timed sectional accuracy
Coding / programming logic Easy-medium DSA or output-style MCQs Handle tricky inputs
Technical interview OOPs, DBMS, OS, projects Explain aloud
HR Fit, location, intent A few real examples ready

First round: Amex Online Assessment
Skills emphasized: DSA, Java, SQL, product thinking
Languages: Java, Python, SQL

Sample American Express questions with solutions

These are practice-style questions aligned to patterns students report for American Express drives around 2026. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.

Quantitative aptitude (2026)

Q1: Pipe fill

Problem: Pipe A fills a tank in 6 hours and pipe B in 8 hours. How long do they take together to fill it?

Solution: Combined rate = 1/6 + 1/8 = 4/24 + 3/24 = 7/24. Time = 24/7 hours ≈ 3 hours 26 minutes.

Answer: 24/7 hours

Q2: Simple interest

Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.

Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.

Answer: ₹1600

Q3: Percentage recover

Problem: If 30% of a number is 150, what is the number?

Solution: 0.3x = 150 → x = 150 / 0.3 = 500.

Answer: 500

Q4: Average after replace

Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?

Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.

Answer: 16

Q5: Series n(n+1)

Problem: Find the next term: 2, 6, 12, 20, 30, ?

Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.

Answer: 42

Q6: Deck probability

Problem: What is the probability of drawing an ace from a standard 52-card deck?

Solution: There are 4 aces in 52 cards. Probability = 4/52 = 1/13.

Answer: 1/13

Q7: Net percent change

Problem: A number is increased by 20% and then decreased by 20%. What is the net percentage change?

Solution: Start with 100 → 120 → 96. Net change = 4% decrease. Formula: successive +a then −a gives −(a²/100)% = −4%.

Answer: 4% decrease

Q8: Consumption cut

Problem: If the price of an item rises by 25%, by what percent should consumption fall so that expenditure stays the same?

Solution: Required reduction = r/(100+r) × 100 with r = 25. = 25/125 × 100 = 20%.

Answer: 20%

Logical reasoning (2026)

Q1: Odd one out

Problem: Find the odd one out: 3, 5, 7, 9, 11

Solution: 3, 5, 7, and 11 are prime. 9 = 3×3 is composite, so it is the odd one out.

Answer: 9

Q2: Coding letter shift

Problem: If CAT is coded as DBU, how is DOG coded in the same way?

Solution: Each letter moves +1 in the alphabet: C→D, A→B, T→U. D→E, O→P, G→H → EPH.

Answer: EPH

Q3: Blood relation

Problem: Pointing to a photograph, Ravi says, ‘She is the daughter of my mother’s only son.’ How is the girl related to Ravi?

Solution: Ravi’s mother’s only son is Ravi himself (assuming one son). The girl is therefore Ravi’s daughter.

Answer: Daughter

Q4: Syllogism

Problem: Statements: All engineers are graduates. Some graduates are managers. Conclusion: Some engineers are managers. Does it follow?

Solution: The ‘some graduates’ who are managers need not overlap with the engineers. The conclusion does not follow necessarily.

Answer: Does not follow

Coding practice (2026)

Coding Q1: Linked list cycle

Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.

Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.

Complexity: O(n) time, O(1) space

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q2: Binary tree level order

Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.

Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.

Complexity: O(n) time, O(n) space

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q3: Coin change (min coins)

Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.

Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.

Complexity: O(amount × coins)

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q4: Binary search

Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.

Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.

Complexity: O(log n) time

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q5: Move zeros

Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.

Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.

Complexity: O(n) time, O(1) space

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q6: Rotate array

Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].

Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.

Complexity: O(n) time, O(1) space

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q7: First unique character

Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.

Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.

Complexity: O(n) time

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q8: Stack with min

Problem: Design a stack that supports push, pop, top, and getMin in average O(1) time.

Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.

Complexity: O(1) per operation amortized

American Express tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Deep prep notes for American Express

How the amex Online Assessment usually feels

Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For American Express, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, SQL.

Topic weight hints

Area Why it matters at American Express
DSA What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
Payments, Credit Cards awareness Helps in managerial / HR conversations
Communication Explain your approach clearly; keep a few real examples ready for HR

14-Day sprint

  1. Days 1-3: Learn the 2026 pattern and take two sectional mocks
  2. Days 4-7: Closed practice on weak topics from your error log
  3. Days 8-10: Full mocks every other day; review the same day
  4. Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready

Comments & Suggestions

Similar companies

Mastercard · Visa · Capital One · PayPal · Barclays