Stripe 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
This page collects Stripe placement papers from 2024 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.
Stripe 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Stripe 2024 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
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
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%)
| 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
These are practice-style questions aligned to patterns students report for Stripe drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Problem: A person covers a distance at 60 km/h and returns at 40 km/h. What is the average speed for the whole trip?
Solution: For equal distances, average speed = 2ab/(a+b). = 2×60×40 / (60+40) = 4800/100 = 48 km/h.
Do not take the arithmetic mean (50); that would be wrong here.
Answer: 48 km/h
Problem: A shopkeeper marks goods 20% above cost and then gives a 10% discount. What is the profit percentage?
Solution: Let CP = ₹100. Marked price = ₹120. Discount = 10% of 120 = ₹12. SP = 120 − 12 = ₹108. Profit % = 8%.
Answer: 8%
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
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
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
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
Problem: If 30% of a number is 150, what is the number?
Solution: 0.3x = 150 → x = 150 / 0.3 = 500.
Answer: 500
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
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.
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
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.
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
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.
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
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.
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)
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.
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
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.
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
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.
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
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.
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.
| 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 |
Razorpay · PayPal · PhonePe · Visa · Mastercard