Optum 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Optum Placement Papers 2025
Overview
This page collects Optum 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 Optum patterns and recent shifts.
Download / jump links
Optum 2025 coding
DSA practice aligned to Optum online assessments
Optum interview experience
Round structure and tips from student reports
Optum prep guide
Study plan and weekly schedule
Optum 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
Reasoning
All pens are books. Some books are papers. Conclusion: Some pens are papers.
No definite overlap between pens and papers.
Quantitative
A person covers a certain distance at a speed of 50 km/h and returns at 30 km/h. What is the average speed for the entire journey?
Let distance = D km Time forward = D/50 hours Time return = D/30 hours Total time = D/50 + D/30 = D(3+5)/150 = 8D/150 = 4D/75 hours Total distance = 2D km Average speed = 2D / (4D/75) = 2D × 75/4D = 37.5 km/h
Quantitative
The price of a product is increased by 25%. By what percentage should the consumption be reduced so that the expenditure remains the same?
Correct answer: 20%
Verbal
Problem: Choose the synonym for "Ephemeral": a) Eternal b) Transient c) Permanent d) Perpetual
"Ephemeral" means lasting for a very short time, temporary. "Transient" has the same meaning.
Reasoning
In a row of 30 students, A is 10th from the left. Rank from the right is:
From right = 30-10+1 = 21.
Reasoning
In how many ways can 4 books be arranged on a shelf?
Correct answer: 24 ways
Quantitative
Select 3 people from 10 for a committee. How many ways?
Correct answer: C(10,3) = 10!/(3!×7!) = 120
Reasoning
Find the next number: 2, 6, 12, 20, 30, ?
Differences +4, +6, +8, +10, +12 → next is 42.
Verbal
Find the synonym of "Benevolent".
Correct answer: Kind
Quantitative
Compound Interest - Yearly vs Half-Yearly
Correct answer: ₹3.93 (approximately)
Verbal
Choose the correctly spelled word:
Correct spelling is Accommodation.
Verbal
Neither the teacher nor the students _____ present.
Verb agrees with nearer subject (students) → were.
Reasoning
Find the missing number: 5, 11, 23, 47, 95, ?
Correct answer: 191
Quantitative
The ratio of boys to girls in a class is 3:2. If there are 30 students, how many are girls?
Correct answer: 12 girls
Quantitative
If "ACCENTURE" is coded as "ERUTNECCA", how is "SYSTEM" coded?
Pattern: Letters are reversed ACCENTURE → ERUTNECCA (reversed) SYSTEM → METSYS (reversed)
Your score
0/15(0%)
Review
Optum exam pattern 2025
| 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: Optum Online Assessment
Skills emphasized: Coding, SQL, healthcare domain basics
Languages: Java, Python, SQL
Sample Optum questions with solutions
These are practice-style questions aligned to patterns students report for Optum 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: Permutation basic
Problem: In how many ways can 5 different books be arranged on a shelf?
Solution: Arrangements of 5 distinct items = 5! = 120.
Answer: 120
Q2: Consecutive integers
Problem: If the sum of three consecutive integers is 72, what is the smallest of these integers?
Solution: Let the integers be x, x+1, and x+2.
x + (x+1) + (x+2) = 72 3x + 3 = 72 3x = 69 x = 23
So the integers are 23, 24, and 25.
Answer: 23
Q3: Train and pole
Problem: A train 150 meters long passes a pole in 15 seconds. What is its speed in km/h?
Solution: Distance = 150 m = 0.15 km. Time = 15 s = 15/3600 h = 1/240 h. Speed = 0.15 ÷ (1/240) = 0.15 × 240 = 36 km/h.
Faster check: 150/15 = 10 m/s → 10 × 18/5 = 36 km/h.
Answer: 36 km/h
Q4: Profit on a pen
Problem: If the cost price of a pen is ₹40 and it is sold at a 25% profit, what is the selling price?
Solution: Profit = 25% of 40 = ₹10. Selling price = 40 + 10 = ₹50.
Or SP = CP × 1.25 = 40 × 1.25 = ₹50.
Answer: ₹50
Q5: A and B together
Problem: A can finish a job in 10 days and B in 20 days. How long will they take working together?
Solution: A’s one-day work = 1/10. B’s one-day work = 1/20. Together = 1/10 + 1/20 = 3/20 per day. Time = 20/3 ≈ 6.67 days (6 days 16 hours).
Answer: 20/3 days
Q6: Sum of naturals
Problem: What is the sum of the first 50 natural numbers?
Solution: Sum of first n naturals = n(n+1)/2. For n = 50: 50 × 51 / 2 = 1275.
Answer: 1275
Q7: Average speed
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
Q8: Marked price discount
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%
Coding practice (2025)
Coding Q1: 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
Optum 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: 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
Optum 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: 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
Optum 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: 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
Optum 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: 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
Optum 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: 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
Optum 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: 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
Optum 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: 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
Optum 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 Optum
How the Optum 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 Optum, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, SQL.
Topic weight hints
| Area | Why it matters at Optum |
|---|---|
| Coding | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Health Tech (UnitedHealth) 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