Coding questions
Nagarro Online Assessment
Overview
Here is how public prep guides and student write-ups describe the Nagarro online assessment. This is not an official company brochure.
Compared with Coforge in the same guide as more logic/coding-leaning.
Usual selection rounds
Rounds students usually mention: Logical reasoning / coding-leaning assessment → Interview
| Item | From student reports |
|---|---|
| Platform | Online assessment (varies) |
| Online test summary | PapersAdda: Nagarro often leans harder on logical reasoning and coding than a full big campus IT drive aptitude stack; still check your college placement email. |
| Eligibility notes | Verify drive mail |
| Branches (reported) | Drive-specific |
Online test sections
| Section | Questions | Time | Notes |
|---|---|---|---|
| Logical reasoning | - | - | - |
| Coding | - | - | Strong emphasis in from student reports prep advice |
Extra notes from sources
- Check your college placement email for the platform, section order, and timing.
Sample practice question styles
These are practice questions for speed - not claimed to be from a real Nagarro live paper.
Coding Q1: 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
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: 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
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: 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
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: 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)
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.
Prep tips from those student reports
- Logic + coding first
- Keep a project explanation sheet ready
Sources
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.
Comments & Suggestions
Related
Similar companies
EPAM · Thoughtworks · Persistent Systems · Globant · Publicis Sapient