Nagarro 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Nagarro Placement Papers 2025
Overview
This page collects Nagarro 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 Nagarro patterns and recent shifts.
Download / jump links
Nagarro 2025 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 2025
| 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 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2025)
Q1: 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
Q2: 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
Q3: 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
Q4: 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%
Q5: 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%
Q6: 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
Q7: 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
Q8: 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
Logical reasoning (2025)
Q1: Series multiply
Problem: Find the next number: 3, 9, 27, 81, ?
Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.
Answer: 243
Q2: 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
Q3: 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
Q4: 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
Coding practice (2025)
Coding Q1: 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 Q2: 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 Q3: 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 Q4: 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 Q5: 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.
Coding Q6: 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
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: 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
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: 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
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 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
Comments & Suggestions
Related
Similar companies
EPAM · Thoughtworks · Persistent Systems · Globant · Publicis Sapient