Optum 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Optum Placement Papers 2024
Overview
This page collects Optum 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 Optum patterns and recent shifts.
Download / jump links
Optum 2024 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 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: 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 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2024)
Q1: 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
Q2: 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
Q3: 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
Q4: 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
Q5: 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%
Q6: 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%
Q7: 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
Q8: 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
Coding practice (2024)
Coding Q1: 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)
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: Binary search
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
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: Move zeros
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
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: Rotate array
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
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: 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
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: 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
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: 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
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: 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.
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 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