Bloomberg 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Bloomberg Placement Papers 2024
Overview
This page collects Bloomberg 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 Bloomberg patterns and recent shifts.
Download / jump links
Bloomberg 2024 coding
DSA practice aligned to Bloomberg online assessments
Bloomberg interview experience
Round structure and tips from student reports
Bloomberg prep guide
Study plan and weekly schedule
Bloomberg 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 becomes ₹2,400 in 2 years and ₹3,200 in 4 years at simple interest. Find the principal amount.
Interest for 2 years = 3200 - 2400 = ₹800 Interest per year = ₹400 Interest for 2 years = ₹800 Principal = 2400 - 800 = ₹1,600
Quantitative
In a class of 40 students, Ravi ranks 15th from the top. What is his rank from the bottom?
Total students = 40 Rank from top = 15 Rank from bottom = 40 - 15 + 1 = 26
Quantitative
The following table shows sales (in crores) of a company over 5 years. Find the average annual growth rate.
Total growth = 200 - 100 = 100 crores Number of years = 4 (from 2020 to 2024) Average annual growth = 100/4 = 25 crores per year
Quantitative
What is the output for n=7?
Correct answer: TRUE
Quantitative
If "APPLE" is coded as "BQQMF", how is "ORANGE" coded?
Correct answer: PSBOHF
Reasoning
If all roses are flowers and some flowers are red, which statement is definitely true?
Correct answer: Some red things are flowers
Reasoning
If P means +, Q means −, R means ×, then 18 R 2 P 6 Q 4 = ?
18 × 2 + 6 − 4 = 36 + 6 − 4 = 38.
Verbal
Synonym of "Rapid":
Rapid means fast.
Reasoning
Complete the series: AZ, BY, CX, ?
First letter +1, second −1 → DW.
Quantitative
If Rs. 58 is divided among 150 children such that each girl and each boy gets 25 p and 50 p respectively. Then how many girls are there?
Correct answer: 68 girls
Verbal
Choose the correctly used word: "The manager _____ the importance of teamwork."
"Emphasize" is a transitive verb and doesn't require a preposition.
Verbal
Choose the correct form: "The number of students _____ increased."
Correct answer: has
Verbal
Neither the teacher nor the students _____ present.
Verb agrees with nearer subject (students) → were.
Reasoning
All cats are dogs. Some dogs are rats. Conclusions: I. Some cats are rats. II. Some rats are dogs.
II follows from "some dogs are rats". I does not necessarily follow.
Reasoning
Find the next number in the series: 2, 6, 12, 20, 30, ?
Pattern analysis: - 2 = 1 × 2 - 6 = 2 × 3 - 12 = 3 × 4 - 20 = 4 × 5 - 30 = 5 × 6 Next term = 6 × 7 = 42
Your score
0/15(0%)
Review
Bloomberg exam pattern 2024
| 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: Bloomberg OA
Skills emphasized: Hard DSA, C++/systems, low latency
Languages: C++, Python, Java
Sample Bloomberg questions with solutions
These are practice-style questions aligned to patterns students report for Bloomberg drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2024)
Q1: 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
Q2: 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
Q3: 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
Q4: SI three years
Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.
Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.
Answer: ₹1200
Q5: Boat upstream
Problem: A boat’s speed in still water is 15 km/h and the stream is 3 km/h. How long to cover 36 km upstream?
Solution: Upstream speed = 15 − 3 = 12 km/h. Time = 36 / 12 = 3 hours.
Answer: 3 hours
Q6: Mixture milk
Problem: A mixture has milk and water in the ratio 4:1. If 5 litres of water are added to 20 litres of mixture, what is the new milk:water ratio?
Solution: In 20 L: milk = 16 L, water = 4 L. After adding 5 L water: milk 16, water 9. Ratio = 16:9.
Answer: 16:9
Q7: CI vs SI hint
Problem: Find compound interest on ₹10,000 at 10% per annum for 2 years, compounded annually.
Solution: Amount = 10000 × (1.1)² = 10000 × 1.21 = ₹12,100. CI = 12100 − 10000 = ₹2100. (SI for same period would be ₹2000; the extra ₹100 is interest on first-year interest.)
Answer: ₹2100
Q8: Clock angle
Problem: What is the angle between the hour and minute hands at 3:00?
Solution: At 3:00 the hands are exactly 90° apart (one quarter of the circle).
Answer: 90°
Coding practice (2024)
Coding Q1: 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
Bloomberg 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: 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
Bloomberg 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: 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
Bloomberg 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: 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
Bloomberg 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: 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
Bloomberg 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: 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
Bloomberg 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: 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
Bloomberg 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: 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
Bloomberg 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 Bloomberg
How the Bloomberg 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 Bloomberg, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: C++, Python, Java.
Topic weight hints
| Area | Why it matters at Bloomberg |
|---|---|
| Hard DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Financial Data & Terminals 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 2024 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
D. E. Shaw · Goldman Sachs · BlackRock · Google · Microsoft