Nagarro 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
Nagarro 2026 Pattern Details
Overview
This page collects Nagarro 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 Nagarro patterns and recent shifts.
Download / jump links
Nagarro 2026 coding
DSA practice aligned to Nagarro online assessments
Nagarro interview experience
Round structure and tips from student reports
Nagarro prep guide
Study plan and weekly schedule
Nagarro 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
If all roses are flowers, and some flowers are red, which must be true?
From "all roses are flowers" and "some flowers are red", we cannot conclude about roses being red. But "some red things are flowers" must be true.
Quantitative
A is twice as efficient as B. Together they complete a work in 12 days. In how many days will A alone complete it?
Let B's efficiency = 1 unit/day A's efficiency = 2 units/day Together: 1 + 2 = 3 units/day Total work = 3 × 12 = 36 units A alone: 36 / 2 = 18 days
Reasoning
What is the value of x? Statement I: x² - 6x + 8 = 0. Statement II: x
Statement I: x² - 6x + 8 = 0 (x - 2)(x - 4) = 0 x = 2 or x = 4 Statement II: x < 5 (both 2 and 4 satisfy this) Combining both: x = 2 or x = 4 (both < 5)
Reasoning
Statements: 1. Some cats are dogs, 2. All dogs are animals, 3. No animal is a bird
From statements 1 and 2: Some cats are animals (I follows) From statements 2 and 3: No dog is a bird (II follows) From I: Some animals are cats (III follows)
Quantitative
A man can do a piece of work in 10 days, and another man can do it in 15 days. How long will they take to complete the work together?
First man's 1 day work = 1/10 Second man's 1 day work = 1/15 Combined 1 day work = 1/10 + 1/15 = (3+2)/30 = 5/30 = 1/6 Time taken together = 6 days
Reasoning
A is taller than B but shorter than C. D is shorter than B. Who is tallest?
C > A > B > D → C is tallest.
Quantitative
A can do a piece of work in 10 days and B in 15 days. Days to finish together:
1/10 + 1/15 = 1/6 → 6 days.
Reasoning
Find the missing number: 2, 6, 12, 20, 30, ?
Pattern: Differences are 4, 6, 8, 10 (increasing by 2) Next difference = 12 Next number = 30 + 12 = 42
Reasoning
Find the next number: 2, 6, 12, 20, 30, ?
Differences +4, +6, +8, +10, +12 → next is 42.
Verbal
"The committee have decided": correct form is:
Collective noun "committee" as one unit takes singular "has".
Verbal
Find the synonym of "Benevolent".
Correct answer: Kind
Verbal
Synonym of "Abundant":
Abundant means plentiful.
Quantitative
Price rises by 25%. By what % should consumption fall to keep expenditure the same?
Reduction = 25/(100+25)×100 = 20%.
Verbal
Identify the error type: "He don't know the answer."
He doesn't / does not - subject-verb agreement.
Quantitative
The average of 5 numbers is 42. If one number 32 is removed, the new average is:
Sum = 210. New sum = 178. Average = 178/4 = 44.5.
Your score
0/15(0%)
Review
Nagarro exam pattern 2026
| Section | What shows up | Prep focus |
|---|---|---|
| Aptitude / logical | Quant, reasoning, sometimes verbal | Timed sectional accuracy |
| Coding / programming logic | Easy-medium DSA or output-style MCQs | Handle tricky inputs |
| Technical interview | OOPs, DBMS, OS, projects | Explain aloud |
| HR | Fit, location, intent | A few real examples ready |
First round: Nagarro Coding Assessment
Skills emphasized: DSA, coding, problem-solving
Languages: Java, C++, Python
Sample Nagarro questions with solutions
These are practice-style questions aligned to patterns students report for Nagarro 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: 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
Q2: 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
Q3: 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
Q4: Series multiply
Problem: Find the next number: 3, 9, 27, 81, ?
Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.
Answer: 243
Coding practice (2026)
Coding Q1: 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
Nagarro 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: 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
Nagarro 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: 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
Nagarro 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: 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
Nagarro 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: 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
Nagarro 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: 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
Nagarro 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: 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
Nagarro 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: 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
Nagarro 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 Nagarro
How the Nagarro coding 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 Nagarro, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, C++, Python.
Topic weight hints
| Area | Why it matters at Nagarro |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Digital Engineering 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
EPAM · Thoughtworks · Persistent Systems · Globant · Publicis Sapient