Nagarro pvt limited interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Nagarro pvt limited
3 rounds | 2 Coding
problems
Selected Interview preparation journey
Application story
I was referred by a company employee. There was one aptitude round and one coding round. The interviewer was very helpful; they asked one coding question and some OOP and SQL-related questions. After that, I received a call from HR regarding shortlisting.
Why selected/rejected for the role?
I provided a proper solution during the technical round. The interviewer was also helpful when I was stuck and was very friendly.
Preparation
Duration: 2 Months
Topics: Data Structures & Algorithms, Object-Oriented Programming System, DBMS, CN
Tip 1: Prepare DSA thoroughly, and I recommend Coding Ninjas for interview preparation.
Tip 2: Prepare well for your projects.
Tip 3: Be confident and relaxed during the interview.
Application process
Where: Referral
Eligibility: 7.5 CGPA
Tip 1: Keep your resume concise and aim for one page only. Mention all the skills you are confident in.
Tip 2: Do not include false information on your resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date10 Jun 2022
Coding problem0
40 MCQ-based questions were related to DSA and OOPS.
02
Round
Medium
Online Coding Test
Duration150 minutes
Interview date12 Jun 2022
Coding problem1
The test was divided into 2 sections, In section one there were 3 DSA questions with medium difficulty and In section 2, there were 2 DSA questions with hard difficulty.
1. Longest Palindromic Substring
Moderate
35m average time
78% success
0/80
Asked in companies
You are given a string ‘S’ of length ‘N’.
You must return the longest palindromic substring in ‘S’.
Note: Return any of them in case of multiple substrings with the same length.
Example:
Input: ‘S’ =’badam’
Output: ‘ada’
‘ada’ is the longest palindromic substring, and it can be proved that it is the longest possible palindromic substring.
Problem approach
By using Dynamic programming, I was able to solve.
03
Round
Medium
Video Call
Duration60 Minutes
Interview date24 Jun 2022
Coding problem1
The interviewer was very friendly, they asked 1 coding question and some oops SQL-related questions.
1. Maximum Subarray Sum
Moderate
25m average time
75% success
0/80
Asked in companies
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.
Given the array [-5, -1, -8, -9], the maximum sum would be -1.
Follow up: Do this in O(N) time.
Problem approach
The simple idea of Kadane’s algorithm is to look for all positive contiguous segments of the array. By using Kadane's Algo Solved this problem.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Associate Software Developer
3 rounds | 11 problems
Interviewed by Nagarro pvt limited
Selected 
485 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Nagarro pvt limited
Rejected
291 views
0 comments
0 upvotes
Trainee Software Engineer
4 rounds | 5 problems
Interviewed by Nagarro pvt limited
Selected 585 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
Selected 2370 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 2672 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
Selected 2347 views
0 comments
0 upvotes