Skip to content

Mastercard 2026 Pattern Details

Overview

This page collects Mastercard 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 Mastercard patterns and recent shifts.

Mastercard 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

Mastercard exam pattern 2026

Section What shows up Prep focus
Online assessment Coding and/or MCQ filter Weekly timed mocks
Technical rounds DSA, CS fundamentals, projects Live problem solving
HR / hiring manager Motivation and communication Specific, evidence-based answers

First round: Mastercard Codility / OA
Skills emphasized: DSA, payments concepts, system design
Languages: Java, Python, C++

Sample Mastercard questions with solutions

These are practice-style questions aligned to patterns students report for Mastercard 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: 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

Q2: 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

Q3: 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

Q4: 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

Q5: 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

Q6: 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

Q7: 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%

Q8: Compound mark-discount

Problem: An article is marked 40% above cost and sold after a 10% discount. Find the profit percent.

Solution: SP = CP × 1.4 × 0.9 = 1.26 CP. Profit = 26%.

Answer: 26%

Coding practice (2026)

Coding Q1: Check prime

Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.

Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.

Complexity: O(√n) time

Mastercard 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: Valid parentheses

Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.

Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.

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

Mastercard 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: Two Sum

Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.

Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.

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

Mastercard 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: Longest substring without repeating characters

Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).

Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.

Complexity: O(n) time

Mastercard 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: Merge overlapping intervals

Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.

Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.

Complexity: O(n log n) time from the sort

Mastercard 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: Top K frequent elements

Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.

Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.

Complexity: O(n log k) with a heap

Mastercard 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: 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

Mastercard 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: 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

Mastercard 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 Mastercard

How the Mastercard Codility / OA usually feels

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

Topic weight hints

Area Why it matters at Mastercard
DSA What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
Payments Networks 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

Visa · PayPal · American Express · PhonePe · Stripe