Nagarro Software interview experience Real time questions & tips from candidates to crack your interview

Associate Software Engineer

Nagarro Software
upvote
share-icon
3 rounds | 9 Coding problems

Interview preparation journey

expand-icon
Journey
My journey started like most others, confused, curious and a little overwhelmed. When I began my B.Tech in Computer Science in Delhi Technological University. I didn't have extraordinary skills or big achievements. In my first and second year, I focused mainly on strengthening data structures and algorithms. Till date I have solved over 1300+ problems, which helped me build consistency, logical thinking, and confidence in approaching new problems. Later, through interview process of seniors, and their guidance, I got interviews aren’t just about DSA, they’re about building real systems. So I started exploring full stack development. I built projects like Shakescript, an AI driven story generator, and DTU Pixels, a real time contest platform. These projects helped me understand backend architecture, databases, APIs, and problem solving beyond theory. My internship experience further exposed me to production level systems and teamwork, which improved both my technical depth and communication skills. There were rejections along the way, but each one taught me something. Cracking this interview wasn’t a sudden achievement, it was the result of consistent effort, continuous learning, and not giving up. If I’ve learned one thing, it’s this: stay consistent, keep building, and trust the process. Results follow.
Application story
I applied through the on-campus placement drive. A total of 793 eligible students took the Online Assessment in the campus labs. The process started with two rounds of Online Assessment. This round lasted 1.5 hours and consisted of MCQ-based questions on Computer Networks, OOPS, DBMS, Aptitude, Coding MCQs, and English. It mainly tested fundamental concepts and basic understanding. After a 10-minute break, the second round started. It was a 1.5-hour coding test with three coding questions. One question required the Sliding Window technique, another was a simple string manipulation problem, and the third was based on Dynamic Programming. I was able to fully solve the first two questions and partially solve the DP problem. Overall, the process was designed to evaluate both theoretical knowledge and problem-solving ability under time constraints.
Why selected/rejected for the role?
In my opinion, I was chosen due to good foundations in DSA and core topics, as well as experience in projects. I could effectively solve coding tasks, and MCQs, clearly demonstrate my solution. Practical exposure in the form of internships and full stack projects also assisted me in showing practical knowledge that was not just theoretical. Consistency of preparation and effective communication in general made the difference.
Preparation
Duration: 4 months
Topics: Data Structures and Algorithms, Recursion, OOPS, SQL, OS, Computer Networks, System Design Basics, JavaScript, React
Tip
Tip

Tip 1: Focus on in depth knowledge, not just number of technologies. for ex- deep dive on javascript and its working, and react for frontend based roles, pick a backend technology and master it.
Tip 2: Learn to explain your projects clearly in an interview. Many students build good projects but fail to communicate the architecture, trade offs, and challenges faced etc, effectively.
Tip 3: Participate in coding contests. They improve speed, pressure handling, and pattern recognition in dsa problems.
Tip 4: Treat rejections as feedback. After each interview analyse the shortcomings and questions you could not answer properly and make note of them for future.

Application process
Where: Campus
Eligibility: 6 CGPA, (Salary package: 12 LPA)
Resume Tip
Resume tip

Tip 1: Prioritize adding relevant skills. If applying for SDE roles, DSA, backend, frontend, and core CS subjects and tech should be clearly mentioned
Tip 2: Avoid listing too many technologies. Only include tools and tech you can confidently answer about in an interview.
Tip 3 : Be ready to explain every single line on your resume, many interviewers do this.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration180 minutes
Interview date4 Nov 2025
Coding problem2

Online assessment was conducted in campus labs in the morning, with 3–4 Nagarro employees present to supervise. The process was well organized and time bound, with clear instructions given before test.

The test consisted of 37 MCQs on aptitude, core fundamentals and 2 coding problems.

1. Unique Gift Packing

Moderate
0/80

You are a gift packer preparing for a large event. You are given an array items of size N, where each element represents a type of gift. You need to select a collection of gifts to pack based on a special set of rules.


The rules for packing are:

You can choose to include any number of available gift types.
For each type of gift you choose to pack, you can take one or more items of that type, up to the total number available.
The number of items you pack for each selected type (its "packed frequency") must be unique. For example, you cannot pack 5 items of type 'A' and also 5 items of type 'B'.


Your goal is to maximize the total number of individual items packed. Return this maximum number..

Problem approach

Step 1: Count frequency of each item type using a hash map.
Step 2: Store frequencies in a vector and sort in descending order.
Step 3: Traverse frequencies and use a set to ensure uniqueness.
If a frequency is already used, reduce it until it becomes unique (or 0).
Step 4: Add valid frequencies to total and return the sum.

Try solving now

2. Optimal Line Arrangement

Moderate
0/80

You are tasked with formatting a document composed of N words. You are given the length of each word. These words must be arranged into lines, preserving their original relative order.


The formatting rules are as follows:

Each line can have a maximum of K characters.
Words on the same line are separated by a single space.
A line is considered "correct" if the number of empty spaces at the end of the line is less than or equal to a given threshold, M. Otherwise, the line is "incorrect".


Your goal is to arrange the words into lines to achieve the maximum possible score, where the score is defined as (number of correct lines) - (number of incorrect lines).

Problem approach

Step 1: Try all possible ways of grouping consecutive words into lines without exceeding K.
Step 2: For each line, calculate remaining spaces.
Step 3: If remaining ≤ M → +1 (correct), else −1 (incorrect).
Step 4: Use recursion + DP to maximize total difference.

Try solving now
02
Round
Medium
Video Call
Duration25 minutes
Interview date13 Nov 2025
Coding problem6

The online interview round was conducted on Microsoft Teams by a senior employee from Nagarro.

1. Longest Substring Without Repeating Characters

Moderate
30m average time
65% success
0/80
Asked in companies
AdobeInformaticaIntuit

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

Problem approach

Step 1 : Brute force : Generate all possible substrings and check each substring for duplicate characters using a set. Keep track of the maximum valid length.
Step 2: (Optimal – O(N)): Use Sliding Window + HashMap/array to store the last index of characters.
Move the right pointer forward; if a duplicate is found within the window, move the left pointer to last_index + 1. Maintain the maximum length.

Try solving now

2. 3Sum

Moderate
15m average time
85% success
0/80
Asked in companies
Goldman SachsAdobeAmazon

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Problem approach

Directly gave optimal answer- sort the array.
Fix one element, then use two pointers (left & right) to find the remaining two elements whose sum equals nums[i].
Skip duplicates while moving pointers to avoid repeated triplets.

Try solving now

3. System Design

(Learn) Design a browser system that supports the following operations:
Visit a new webpage
back() : Go to previously visited page (Undo)
forward() : Go to next page if available (Redo)

Problem approach

Tip 1: Use two stacks : one for back history and one for forward history.
Tip 2: On visiting a new page, clear the forward stack (because redo history becomes invalid).
Tip 3: Understand stack operations clearly (push, pop) and practice implementation-based problems on stacks.

4. DBMS

What is normalization? (Learn)

Problem approach

Prepare common DBMS interview questions.

5. Second Highest Salary

Write a SQL query for second highest salary. (Practice)

Problem approach

Practice common SQL interview queries like nth highest salary, joins, group by, and subqueries.

6. React JS

  • What is virtual DOM? (Learn)
  • How would you debug production bugs in react? (Learn)
Problem approach

Tip 1: Always enable proper logging and error monitoring in production.
Tip 2: Understand React lifecycle, state flow, and component re-rendering clearly.

03
Round
Easy
HR Round
Duration15 minutes
Interview date13 Nov 2025
Coding problem1

The online round was conducted on Microsoft Teams by an HR representative from Nagarro.

1. HR Questions

  • Introduce yourself.
  • Why do you want to join Nagarro?
  • What do you know about Nagarro?
  • Do you think English Communication is important at companies?
  • Do you use prefer to use AI for thinking or not?
Problem approach

Tip 1: Research the Company and mention its global digital engineering presence, talk about learning culture and growth opportunities.
Tip 2: Emphasize that clear communication improves teamwork. Mention its importance in client interactions.
Tip 3: Clarify that AI is a productivity tool, not a replacement for thinking.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
Associate Software Engineer
3 rounds | 3 problems
Interviewed by Nagarro Software
1694 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Nagarro Software
937 views
0 comments
0 upvotes
company logo
Associate Software Engineer
4 rounds | 5 problems
Interviewed by Nagarro Software
941 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Nagarro Software
838 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
2410 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
2775 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
2405 views
0 comments
0 upvotes