Nagarro interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Nagarro
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Journey
I started learning Data Structures and Algorithms in my third year of college, and that’s when things really clicked for me. I spent hours practicing, working on coding problems, and even got into competitive programming to improve my speed and logic. Along the way, I joined study groups, which made learning more enjoyable and helped me stay motivated. Each project I completed taught me something new, and I kept building on these skills bit by bit. By the time I reached the interview stage, I could confidently explain my thought process and solve problems efficiently, which truly impressed the interviewers. Looking back, all that practice and persistence paid off!
Application story
I applied for this role through my college placement portal as part of an on-campus placement drive. The process began with an online test that included a 60-minute aptitude section, where we tackled logical reasoning and quantitative questions. Following this, there was a 150-minute coding test featuring two programming problems focused on data structures and algorithms.
Why selected/rejected for the role?
I was selected for the role because I was well-prepared and managed to answer all the technical interview questions confidently. My strong understanding of data structures and algorithms, along with my hands-on project experience, helped me tackle each question effectively.
Preparation
Duration: 2 Months
Topics: Data Structures, Stacks, Linked list, OOPs, Python
Tip 1: Practice stacks and OOP questions.
Tip 2: Work on open-source projects.
Tip 3: Practice coding in one programming language.
Application process
Where: Campus
Eligibility: Above 7 CGPA (Salary: 4.5 LPA)
Tip 1: Have some good projects.
Tip 2: Do not put false things on resume.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration210 Minutes
Interview date8 Jul 2022
Coding problem1
1. Arranging Array
Easy
15m average time
85% success
0/40
Asked in companies
You are given an array of N integers. Your task is to rearrange the elements of the array such that the total XOR sum of all adjacent elements is maximized.
The XOR sum is defined as follows. For an array a of size N, compute:
F = (a[1] ⊕ a[0]) + (a[2] ⊕ a[1]) + ... + (a[N-1] ⊕ a[N-2]) where ⊕ denotes the bitwise XOR operator.
Your goal is to output a permutation of the original array that results in the maximum possible value of F.
Note :
You do not need to print anything; it has already been taken care of. Just implement the given function.
Problem approach
To solve this, we need to check if we can rearrange A such that for each index I, the equation i=(a[i]+i×k) holds. This means finding a permutation of A where each i yields a unique result, covering all values from 0 to n−1. If such an arrangement exists, the condition is met; otherwise, it's not possible.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which SQL clause is used to specify the conditions in a query?
Choose another skill to practice
Similar interview experiences
Software Engineer Trainee
4 rounds | 13 problems
Interviewed by Nagarro
Selected 
726 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3068 views
0 comments
0 upvotes
React developer
1 rounds | 1 problems
Interviewed by Nagarro
Rejected
494 views
0 comments
0 upvotes
Fullstack Developer
2 rounds | 9 problems
Interviewed by Nagarro
Rejected
223 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
15291 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15114 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 10045 views
2 comments
0 upvotes