ONGC 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
ONGC 2026 Pattern Details
Overview
This page collects ONGC placement papers from 2026 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 ONGC patterns and recent shifts.
Download / jump links
ONGC 2026 coding
DSA practice aligned to ONGC online assessments
ONGC interview experience
Round structure and tips from student reports
ONGC prep guide
Study plan and weekly schedule
ONGC 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
Pointing to a photograph, a man said, "She is the daughter of my grandfather's only son." How is the man related to the person in the photograph?
Grandfather's only son = man's father Daughter of man's father = man's sister So the person is the man's sister
Quantitative
The average of 5 numbers is 20. If one number is removed, the average becomes 18. Find the removed number.
Correct answer: 28
Reasoning
All roses are flowers. Some flowers fade quickly. Conclusion: All roses fade quickly.
Only some flowers.
Verbal
Identify the correctly spelled word:
Accommodate has double "c" and double "m".
Quantitative
If the perimeter of a rectangle is 60 cm and its length is twice its breadth, find the area of the rectangle.
Let breadth = x cm, length = 2x cm Perimeter = 2(length + breadth) = 2(2x + x) = 6x = 60 x = 10 cm Length = 20 cm, Breadth = 10 cm Area = 20 × 10 = 200 cm²
Verbal
Choose the correct synonym for "Ephemeral":
"Ephemeral" means lasting for a very short time, temporary. "Temporary" is the synonym.
Reasoning
Odd one out: 121, 144, 169, 196, 225
Others are odd squares.
Quantitative
A, B, and C can complete a work in 10, 15, and 20 days respectively. If they work together, in how many days will they complete the work?
Correct answer: 4.62 days
Reasoning
A person walks 5 km north, then 3 km east, then 2 km south. How far and in which direction is he from the starting point?
Net north = 5 - 2 = 3 km Net east = 3 km Distance = √(3² + 3²) = √18 = 3√2 km Direction = Northeast
Verbal
Problem: "She is good _____ mathematics." a) at b) in c) on d) with
"Good at" is the correct prepositional phrase for skills.
Verbal
Synonym of "Meticulous":
Meticulous means detailed.
Reasoning
Odd one out: 8, 27, 64, 100, 125
Others are perfect cubes; 100 is not.
Reasoning
Odd one out: Triangle, Square, Circle, Rectangle
Circle has no straight sides.
Quantitative
Reading Comprehension - Main Idea (2025)
Correct answer: Renewable energy and its growing importance
Quantitative
If 3x + 5 = 20, then x equals:
3x = 15 → x = 5.
Your score
0/15(0%)
Review
ONGC exam pattern 2026
| Section | What shows up | Prep focus |
|---|---|---|
| Technical / domain | Syllabus aligned to the notification | Topic checklist |
| Aptitude | Quant + reasoning | Speed with accuracy |
| Interview | Subject depth + projects | Clear fundamentals |
First round: ONGC GATE-based Recruitment
Skills emphasized: GATE technical, interview
Languages: N/A for core
Sample ONGC questions with solutions
These are practice-style questions aligned to patterns students report for ONGC drives around 2026. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2026)
Q1: 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%
Q2: 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
Q3: 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
Q4: 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
Q5: 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
Q6: 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
Q7: 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
Q8: 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
Logical reasoning (2026)
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 (2026)
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)
ONGC 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
ONGC 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
ONGC 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
ONGC 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
ONGC 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
ONGC 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
ONGC 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
ONGC 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 ONGC
How the ONGC gate-based recruitment usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For ONGC, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: N/A for core.
Topic weight hints
| Area | Why it matters at ONGC |
|---|---|
| GATE technical | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Oil & Gas Exploration PSU 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 2026 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