Maruti Suzuki 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
Maruti Suzuki 2026 Pattern Details
Overview
This page collects Maruti Suzuki 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 Maruti Suzuki patterns and recent shifts.
Download / jump links
Maruti Suzuki 2026 coding
DSA practice aligned to Maruti Suzuki online assessments
Maruti Suzuki interview experience
Round structure and tips from student reports
Maruti Suzuki prep guide
Study plan and weekly schedule
Maruti Suzuki 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
In a row of 40 students, A is 11th from left and B is 31st from right. How many between A and B?
B from left = 40−31+1 = 10th. A is 11th. They are adjacent → 0 between.
Reasoning
Statements: All roses are flowers. Some flowers are red. Conclusions: I. Some roses are red. II. All red things are roses.
Analyzing the statements: - All roses are flowers (A → B) - Some flowers are red (B → C, some) Conclusion I: Some roses are red - Valid Conclusion II: All red things are roses - Invalid
Verbal
Choose the correct form: "Neither the teacher nor the students _____ present."
Correct answer: were
Quantitative
The LCM of 12 and 18 is:
LCM(12,18) = 36.
Quantitative
Find x: 3x + 7 = 22
3x = 15 → x = 5.
Quantitative
If "COMPUTER" is coded as "EQORWVGT", how is "KEYBOARD" coded?
Correct answer: MGADQCTF
Verbal
Find synonym of "Courageous"
Correct answer: Brave
Reasoning
Find the next number: 1, 8, 27, 64, 125, ?
Correct answer: 216
Quantitative
If "APPLE" is coded as "1225165", how is "MANGO" coded?
Pattern: A=1, B=2, C=3... Z=26 APPLE: A=1, P=16, P=16, L=12, E=5 → 1225165 MANGO: M=13, A=1, N=14, G=7, O=15 → 13114715
Verbal
Problem: Choose the correct sentence: a) The data are incorrect b) The data is incorrect c) The datas are incorrect
"Data" can be singular or plural, but in modern usage, it's often treated as singular. "The data is incorrect" is more commonly accepted.
Reasoning
Complete the series: AZ, BY, CX, ?
First letter +1, second −1 → DW.
Quantitative
A person walks 5 km at 5 km/h and 10 km at 10 km/h. Average speed is:
Time = 1 h + 1 h = 2 h. Average = 15/2 = 7.5 km/h.
Quantitative
In what ratio should water be mixed with milk costing ₹12 per liter to get a mixture worth ₹8 per liter?
Using alligation: Water (₹0) Milk (₹12) \ / \ / \ / \ / \ / ₹8 Ratio = (12-8):(8-0) = 4:8 = 1:2
Reasoning
Statements: All engineers are professionals. Some professionals are managers. Conclusions: I. Some engineers are managers. II. All managers are engineers.
Analyzing the statements: - All engineers are professionals (A → B) - Some professionals are managers (B → C, some) Conclusion I: Some engineers are managers - Since all engineers are professionals, and some professionals are managers, we can say some engineer
Verbal
Choose the correct sentence:
Neither takes singular verb; "options" is plural noun with of.
Your score
0/15(0%)
Review
Maruti Suzuki 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: Maruti Online Test
Skills emphasized: Aptitude, mechanical/auto basics, GD
Languages: C/C++ for electronics tracks
Sample Maruti Suzuki questions with solutions
These are practice-style questions aligned to patterns students report for Maruti Suzuki 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: 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
Q2: 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
Q3: 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°
Q4: 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
Q5: 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
Q6: 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
Q7: 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
Q8: 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
Logical reasoning (2026)
Q1: Odd one out
Problem: Find the odd one out: 3, 5, 7, 9, 11
Solution: 3, 5, 7, and 11 are prime. 9 = 3×3 is composite, so it is the odd one out.
Answer: 9
Q2: Coding letter shift
Problem: If CAT is coded as DBU, how is DOG coded in the same way?
Solution: Each letter moves +1 in the alphabet: C→D, A→B, T→U. D→E, O→P, G→H → EPH.
Answer: EPH
Q3: Blood relation
Problem: Pointing to a photograph, Ravi says, ‘She is the daughter of my mother’s only son.’ How is the girl related to Ravi?
Solution: Ravi’s mother’s only son is Ravi himself (assuming one son). The girl is therefore Ravi’s daughter.
Answer: Daughter
Q4: Syllogism
Problem: Statements: All engineers are graduates. Some graduates are managers. Conclusion: Some engineers are managers. Does it follow?
Solution: The ‘some graduates’ who are managers need not overlap with the engineers. The conclusion does not follow necessarily.
Answer: Does not follow
Coding practice (2026)
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
Maruti Suzuki 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
Maruti Suzuki 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
Maruti Suzuki 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
Maruti Suzuki 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
Maruti Suzuki 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
Maruti Suzuki 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
Maruti Suzuki 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)
Maruti Suzuki 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 Maruti Suzuki
How the maruti online test usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Maruti Suzuki, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: C/C++ for electronics tracks.
Topic weight hints
| Area | Why it matters at Maruti Suzuki |
|---|---|
| Aptitude | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Automotive Manufacturing 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
Comments & Suggestions
Related
Similar companies
Tata Motors · Mahindra · Bosch