Blackrock 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Blackrock Placement Papers 2025
Overview
This page collects BlackRock placement papers from 2025 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 BlackRock patterns and recent shifts.
Download / jump links
Blackrock 2025 coding
DSA practice aligned to BlackRock online assessments
Blackrock interview experience
Round structure and tips from student reports
Blackrock prep guide
Study plan and weekly schedule
BlackRock 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
Quantitative
A sum of money amounts to ₹9800 after 5 years and ₹12005 after 8 years at the same rate of simple interest. Find the rate of interest per annum.
Let Principal = P, Rate = R% After 5 years: P + (P × R × 5)/100 = 9800 After 8 years: P + (P × R × 8)/100 = 12005 Subtracting: (P × R × 3)/100 = 12005 - 9800 = 2205 P × R = 73500 From first equation: P + (73500 × 5)/100 = 9800 P + 3675 = 9800 P = 6125 Rate R =
Reasoning
Which of the following is the next term in the series: 2, 6, 12, 20, 30, ?
Pattern: Differences are 4, 6, 8, 10 (consecutive even numbers) Next difference = 12 Next term = 30 + 12 = 42 Alternative pattern: n(n+1) where n starts from 1 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42
Quantitative
What does "Break the ice" mean?
"Break the ice" means to initiate conversation in a social setting.
Quantitative
A student scored 60, 70, and 80 in three subjects. If the weights are 2, 3, and 5 respectively, find the weighted average.
Correct answer: 73
Quantitative
Simple interest on ₹5,000 at 8% p.a. for 3 years is:
SI = PRT/100 = 5000×8×3/100 = ₹1,200.
Verbal
Problem: "She is allergic _____ peanuts." a) to b) from c) with d) by
"Allergic to" is the correct prepositional phrase.
Verbal
Choose the correctly spelled word:
Correct spelling is Accommodation.
Verbal
Synonym of "Candid":
Candid means frank or straightforward.
Reasoning
If A is brother of B, B is sister of C, C is brother of D, how is D related to A?
A, B, C, D share the same generation → siblings (gender of D unknown but sibling).
Quantitative
A person walks 6 km East, then 8 km North. How far is he from the starting point?
Correct answer: 10 km
Reasoning
In how many ways can 5 people be arranged in a row?
Correct answer: 120 ways
Reasoning
Statements: 1) All cups are plates, 2) All plates are tables Conclusions: I) All cups are tables, II) All tables are cups, III) Some tables are cups, IV) Some tables are plates.
Correct answer: Only I, III, and IV follow
Reasoning
Odd one out: Cat, Dog, Tiger, Car
Others are animals.
Quantitative
A number is increased by 20% and then decreased by 20%. The net percentage change is:
100 → 120 → 96. Net change = 4% decrease.
Verbal
The company's profits have been _____ steadily over the past year.
Correct answer: declining
Your score
0/15(0%)
Review
Blackrock exam pattern 2025
| 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: BlackRock Online Assessment
Skills emphasized: DSA, systems, finance/quant basics
Languages: Java, Python, C++
Sample Blackrock questions with solutions
These are practice-style questions aligned to patterns students report for BlackRock drives around 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2025)
Q1: 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
Q2: 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
Q3: 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%
Q4: 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%
Q5: Loss to profit shift
Problem: An article sold at 10% loss would give 5% profit if sold for ₹60 more. Find the cost price.
Solution: 0.9P + 60 = 1.05P 60 = 0.15P P = 60 / 0.15 = ₹400.
Answer: ₹400
Q6: Worker scaling
Problem: Eight workers finish a job in 10 days. How many days will 10 workers take for the same job (same pace)?
Solution: Total man-days = 8 × 10 = 80. Days for 10 workers = 80 / 10 = 8 days.
Answer: 8 days
Q7: Distance from speed
Problem: A vehicle travels at 60 km/h for 2.5 hours. How far does it go?
Solution: Distance = speed × time = 60 × 2.5 = 150 km.
Answer: 150 km
Q8: Compound ratio
Problem: If two ratios are 3:5 and 5:7, what is the compound ratio?
Solution: Compound ratio = (3/5) × (5/7) = 3/7, written as 3:7.
Answer: 3:7
Logical reasoning (2025)
Q1: Direction turn
Problem: A person walks 5 km north, then 3 km east, then 5 km south. How far is he from the start, and in which direction?
Solution: North 5 and south 5 cancel. He is 3 km east of the start.
Answer: 3 km east
Q2: Series multiply
Problem: Find the next number: 3, 9, 27, 81, ?
Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.
Answer: 243
Q3: Seating hint
Problem: Five friends sit in a row. A is to the left of B but right of C. D is to the right of B and left of E. Who is in the middle?
Solution: Order from left to right: C, A, B, D, E. The middle seat is B.
Answer: B
Q4: Analogy
Problem: Book is to Reading as Fork is to ?
Solution: A book is used for reading; a fork is used for eating.
Answer: Eating
Coding practice (2025)
Coding Q1: 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
BlackRock 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: 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
BlackRock 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: 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
BlackRock 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: 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
BlackRock 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: 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
BlackRock 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: 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
BlackRock 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: 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
BlackRock 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: 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)
BlackRock 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 Blackrock
How the Blackrock 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 BlackRock, 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 BlackRock |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Asset Management, Aladdin Tech 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 2025 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
Bloomberg · Goldman Sachs · JP Morgan · D. E. Shaw · Morgan Stanley