Stripe 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
Stripe 2026 Pattern Details
Overview
This page collects Stripe 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 Stripe patterns and recent shifts.
Download / jump links
Stripe 2026 coding
DSA practice aligned to Stripe online assessments
Stripe interview experience
Round structure and tips from student reports
Stripe prep guide
Study plan and weekly schedule
Stripe 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
Verbal
Fill: Neither the teacher nor the students _____ present.
With neither…nor, verb agrees with nearer subject (students) → were.
Quantitative
A and B invest ₹5,000 and ₹7,000 respectively in a business. After 6 months, A withdraws ₹2,000. If the profit at the end of the year is ₹4,500, find B's share.
A's investment: 5000 × 6 + 3000 × 6 = 30,000 + 18,000 = 48,000 B's investment: 7000 × 12 = 84,000 Ratio = 48,000 : 84,000 = 4 : 7 B's share = 7/(4+7) × 4500 = 7/11 × 4500 = ₹2,863.64
Verbal
Synonym of "Hostile":
Hostile means unfriendly.
Quantitative
A number when divided by 5 leaves remainder 3. What is remainder when twice the number is divided by 5?
n = 5k+3 → 2n = 10k+6 = 5(2k+1)+1 → remainder 1.
Quantitative
A and B can complete a job in 10 and 20 days respectively. How long will it take them to complete the job together?
A's work per day = 1/10 B's work per day = 1/20 Combined work per day = 1/10 + 1/20 = 3/20 Time taken together = 20/3 = 6.67 days
Reasoning
If every letter is shifted +2 in the alphabet, DOG becomes:
Each letter +2 → FQI.
Quantitative
Two cards are drawn from a pack of 52 cards. What is the probability that both are aces?
Probability = (4/52) × (3/51) = (1/13) × (1/17) = 1/221
Reasoning
If in a code, CAT = 24 and DOG = 26, then BAT = ?
Sum of positions: B+A+T = 2+1+20 = 23.
Reasoning
Statements: All engineers are professionals. Some professionals are managers. Conclusions: I. Some engineers are managers. II. All managers are engineers.
Analyzing the statements: - All engineers are professionals (A → B) - Some professionals are managers (B → C, some) Conclusion I: Some engineers are managers - Since all engineers are professionals, and some professionals are managers, we can say some engineer
Verbal
Neither the teacher nor the students _____ present.
Verb agrees with nearer subject (students) → were.
Quantitative
Which of the following is a common protocol used for secure communication over the internet?
HTTPS (HyperText Transfer Protocol Secure) is the secure version of HTTP and is used for secure communication over the internet. It uses SSL/TLS encryption.
Verbal
"To add fuel to the fire" means:
It means worsening a conflict or situation.
Reasoning
A walks 10m North, turns right walks 5m, turns right walks 10m. Direction from start?
Correct answer: East (5m east of starting point)
Quantitative
A bank offers a loan of ₹50,000 at 8% per annum simple interest. What is the interest after 2 years?
Correct answer: ₹8,000
Reasoning
Problem: What is the value of x? Statement 1: x² = 16 Statement 2: x > 0
From statement 1: x = 4 or -4 From statement 2: x > 0 Combining both: x = 4
Your score
0/15(0%)
Review
Stripe 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: Stripe Online Assessment
Skills emphasized: Hard DSA, API/payments design, correctness
Languages: Ruby, Java, Python, Go
Sample Stripe questions with solutions
These are practice-style questions aligned to patterns students report for Stripe 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: Three workers
Problem: A finishes work in 12 days, B in 15 days, and C in 20 days. Working together, how many days do they need?
Solution: Take total work = LCM(12,15,20) = 60 units. A = 5/day, B = 4/day, C = 3/day. Combined = 12 units/day. Time = 60/12 = 5 days.
Answer: 5 days
Q2: Age ratio
Problem: The ratio of ages of A and B is 3:5. After 8 years the ratio becomes 5:7. Find A’s present age.
Solution: Let ages be 3x and 5x. (3x+8)/(5x+8) = 5/7 7(3x+8) = 5(5x+8) 21x + 56 = 25x + 40 4x = 16 → x = 4 A’s age = 12 years.
Answer: 12 years
Q3: 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
Q4: 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
Q5: 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
Q6: 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
Q7: 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
Q8: 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
Coding practice (2026)
Coding Q1: 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
Stripe 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: Maximum subarray sum (Kadane)
Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).
Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.
Complexity: O(n) time, O(1) extra space
Stripe 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: Reverse a string in place
Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.
Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.
Complexity: O(n) time, O(1) extra space
Stripe 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: 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
Stripe 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: 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
Stripe 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: 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
Stripe 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: 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
Stripe 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: 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
Stripe 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 Stripe
How the Stripe 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 Stripe, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Ruby, Java, Python, Go.
Topic weight hints
| Area | Why it matters at Stripe |
|---|---|
| Hard DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Payments Infrastructure awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
14-Day sprint
- Days 1-3: Learn the 2026 pattern and take two sectional mocks
- Days 4-7: Closed practice on weak topics from your error log
- Days 8-10: Full mocks every other day; review the same day
- Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready
Comments & Suggestions
Related
Similar companies
Razorpay · PayPal · PhonePe · Visa · Mastercard