Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Nagarro Team. If you also belong to the team, you can get access from here

Nagarro Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Nagarro Technical Trainee Interview Questions, Process, and Tips

Updated 16 Sep 2021

Top Nagarro Technical Trainee Interview Questions and Answers

  • Q1. Nth Prime Number Problem Statement Find the Nth prime number given a number N. Explanation: A prime number is greater than 1 and is not the product of two smaller natura ...read more
  • Q2. Counting Derangements Problem A derangement is a permutation of 'N' elements, where no element appears in its original position. For instance, a derangement of {0, 1, 2, ...read more
  • Q3. Count Palindrome Words in a String Given a string 'S' consisting of words, your task is to determine the number of palindrome words within 'S'. A word is considered a pa ...read more
View all 18 questions

Nagarro Technical Trainee Interview Experiences

5 interviews found

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 150 minutes
Round difficulty - Medium

It was an Aptitude test and Technical objective test of 60 minutes followed by a Coding test of 90 minutes. The round started at 2:00 PM. Candidates who cleared this round were shortlisted for the next round.

  • Q1. 

    Maximum Sum Path in a Binary Tree

    Your task is to determine the maximum possible sum of a simple path between any two nodes (possibly the same) in a given binary tree of 'N' nodes with integer values.

    Ex...

  • Ans. 

    Find the maximum sum of a simple path between any two nodes in a binary tree.

    • Use a recursive approach to traverse the binary tree and calculate the maximum sum path.

    • Keep track of the maximum sum path found so far while traversing the tree.

    • Consider negative values in the path sum calculation to handle cases where the path can start and end at different nodes.

    • Handle cases where the path can go through the root node or no

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

This was the technical interview round it started at 12:00 pm, here we were asked to explain the codes we wrote in the coding test and after that, we were given a coding problem for which we needed to write a pseudocode solution and explain it to the interviewer. The interviewer was quite polite and understanding even if we got stuck while writing the code he didn't rush the interview. Candidates who cleared this round were shortlisted for the HR round.

  • Q1. 

    Properties of MST in an Undirected Graph

    You have a simple undirected graph G = (V, E) where each edge has a distinct weight. Consider an edge e as part of this graph. Determine which of the given stateme...

  • Ans. 

    In an undirected graph with distinct edge weights, the lightest edge in a cycle is included in every MST, while the heaviest edge is excluded.

    • The lightest edge in a cycle is always included in every MST of the graph.

    • The heaviest edge in a cycle is always excluded from every MST of the graph.

    • This property holds true for all simple undirected graphs with distinct edge weights.

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 20 minutes
Round difficulty - Medium

This round started at 4:00 pm, it was also conducted on Microsoft Teams. In this round, we were asked the basic HR questions.
Basically, the interviewer just wanted to test our confidence and communication skills.

  • Q1. 

    Jumping Game Problem Statement

    In this problem, you have ‘n’ carrots lined up and denoted by numbers 1 through ‘n’. There are ‘k’ rabbits, and each rabbit can jump to carrots that are multiples of its uni...

  • Ans. 

    Calculate uneaten carrots after rabbits jump based on their unique factors.

    • Iterate through each rabbit's jumping factor and mark the carrots they land on as eaten

    • Calculate the remaining uneaten carrots by counting the ones not marked as eaten

    • Consider using a data structure like an array to keep track of eaten carrots efficiently

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology, Manipur. I applied for the job as Trainee Technology in GurgaonEligibility criteriaAbove 6 CGPANagarro interview preparation:Topics to prepare for the interview - Aptitude, Data Structures, Algorithm, OOPS, CodingTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 100 aptitude questions a week 
Tip 2 : Practice coding questions on coding platforms like coding ninjas codestudio, Geeksforgeeks, HackerEarth, etc.
Tip 3 : Prepare for the interview questions

Application resume tips for other job seekers

Tip 1 : The format of your resume should look professional
Tip 2 : Only put those skills in your resume on which you are confident
Tip 3 : Do mention all the projects or internships you have done
Tip 4: Do not put false things on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Sopra Steria

Success to our employee's well-being? A work-life balance that's simply unbeatable.

Our employees have rated us 4 for Work-Life Balance on AmbitionBox

I was interviewed in Jan 2021.

Round 1 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

This round consists of technical interview.
The interviewer ask questions related to the 3 coding problems given in previous round i.e.de-bug the code and explain the time and space complexity.
In last they give one problem of nearest square integer and want the optimized solution only.
The students selected in this round are shortlisted for next round.

  • Q1. 

    Find The Closest Perfect Square Problem Statement

    You are given a positive integer N. Your task is to find the perfect square number that is closest to N and determine the number of steps required to reac...

  • Ans. 

    Find the closest perfect square to a given positive integer and determine the number of steps required to reach that number.

    • Iterate through perfect squares starting from 1 until the square is greater than the given number

    • Calculate the distance between the perfect square and the given number

    • Return the closest perfect square and the distance as output

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Trainee Technology in GurgaonEligibility criteriaAbove 6 CGPANagarro interview preparation:Topics to prepare for the interview - Data Structures,Algorithms,OOPS,DBMS,Aptitude,SQLTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice aptitude questions according to previous year asked questions.
Tip 2 : Practice 5-10 new DSA problem per day.
Tip 3 : Practice 1-2 hard level DSA problem per day.
Tip 4 : For DBMS,OOPS and SQL give 1 week for each.

Application resume tips for other job seekers

Tip 1 : Make 1-2 project according to your skills section.
Tip 2 : Write only those skills in which you are confident of.
Tip 3 : Always update your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Technical Trainee Interview Questions Asked at Other Companies

Q1. Minimum Cost to Destination You are given an NxM matrix consistin ... read more
asked in TO THE NEW
Q2. Find Two Non-Repeating Elements Problem Statement Given an array ... read more
Q3. Maximum of All Subarrays of Size k Given an array of 'N' non-nega ... read more
Q4. Sum Between Zeroes Problem Statement Given a singly linked list c ... read more
asked in Nagarro
Q5. Nth Prime Number Problem Statement Find the Nth prime number give ... read more

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Timing Morning 
Environment Online
3 Coding Questions were asked

  • Q1. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves determining the number of distinct ways to climb from the 0th to the Nth stair by climbing one or two steps at a time.

    • Use dynamic programming to solve this problem efficiently.

    • The number of ways to reach the Nth stair can be calculated by adding the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Consider base cases where N=0 and N=1 separately.

    • Handle large values of N by using modu...

  • Answered by AI
  • Q2. 

    Nth Prime Number Problem Statement

    Find the Nth prime number given a number N.

    Explanation:

    A prime number is greater than 1 and is not the product of two smaller natural numbers. A prime number has exa...

  • Ans. 

    To find the Nth prime number given a number N, implement a function that returns the Nth prime number.

    • Create a function that takes N as input and returns the Nth prime number.

    • Iterate through numbers starting from 2 and check if each number is prime.

    • Keep track of the count of prime numbers found until reaching the Nth prime number.

    • Return the Nth prime number once it is found.

  • Answered by AI
  • Q3. 

    String Compression Problem Statement

    Ninja needs to perform basic string compression. For any character that repeats consecutively more than once, replace the repeated sequence with the character followed...

  • Ans. 

    Implement a function to compress a string by replacing consecutive characters with the character followed by the count of repetitions.

    • Iterate through the input string and keep track of consecutive characters and their counts.

    • Replace consecutive characters with the character followed by the count of repetitions if count is greater than 1.

    • Return the compressed string for each test case.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 40 minutes
Round difficulty - Medium

Timing Morning
Environment Online
Interviewer was very supportive during the Interview

  • Q1. 

    Find All Pairs Adding Up to Target

    Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.

    Input:

    The first line ...
  • Ans. 

    The task is to find all pairs of elements in an array that add up to a given target.

    • Iterate through the array and for each element, check if the target minus the element exists in a hash set.

    • If it exists, add the pair to the result. If not, add the element to the hash set.

    • Print the pairs found or (-1, -1) if no pair is found.

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • Q3. 

    Spiral Order Traversal of a Binary Tree

    Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.

    Input:

    The input consists of a single line containing elem...
  • Ans. 

    The task is to output the Spiral Order traversal of a binary tree given in level order.

    • Implement a function that returns the spiral order traversal as a list

    • Traverse the binary tree in a spiral order, alternating between left to right and right to left

    • Use a queue to keep track of nodes at each level

    • Handle null nodes appropriately in the traversal

    • Example: Input: 1 2 3 -1 -1 4 5, Output: 1 3 2 4 5

  • Answered by AI
Round 3 - HR 

Round duration - 20 minutes
Round difficulty - Easy

Timing Morning
Environment Online
Interviewer was friendly

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Trainee Technology in GurgaonEligibility criteriaAbove 60% in B.tech (CSE/IT/ECE)Nagarro interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Dynamic Programming, Trees ,Graphs ,DBMS and Computer NetworksTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Keep Practicing Ds and Algorithm questions on regular basis.
Tip 2 : Make resume short, simple and to the point.
Tip 3 : Be regular on coding platforms and participate in coding contest.
Tip 4 : Revise Theoretical topics such as computer networks, operating systems etc.

Application resume tips for other job seekers

Tip 1 : Add skills and technologies you are confident with.
Tip 2 : Make resume simple and precise
Tip 3 : Go through the projects you have mentioned in the resume.
Tip 4 : Go through the resume before the interview.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Easy

Timing: Morning (10 AM)
Environment: Online (Proctored)
Coding Round (3 Questions)

  • Q1. 

    Nth Prime Number Problem Statement

    Find the Nth prime number given a number N.

    Explanation:

    A prime number is greater than 1 and is not the product of two smaller natural numbers. A prime number has exa...

  • Ans. 

    Find the Nth prime number given a number N.

    • A prime number is greater than 1 and is not the product of two smaller natural numbers

    • A prime number has exactly two distinct positive divisors: 1 and itself

    • Implement a function to find the Nth prime number based on the given input

  • Answered by AI
  • Q2. 

    Character Formation Check

    Determine if the second string STR2 can be constructed using characters from the first string STR1. Both strings may include any characters.

    Input:

    The first line contains an i...
  • Ans. 

    Check if second string can be formed using characters from the first string.

    • Iterate through each character in STR2 and check if it exists in STR1.

    • Use a hashmap to store the frequency of characters in STR1 for efficient lookup.

    • Return 'YES' if all characters in STR2 are found in STR1, otherwise return 'NO'.

  • Answered by AI
  • Q3. 

    Counting Derangements Problem

    A derangement is a permutation of 'N' elements, where no element appears in its original position. For instance, a derangement of {0, 1, 2, 3} is {2, 3, 1, 0} because each el...

  • Ans. 

    Count the total number of derangements possible for a set of 'N' elements.

    • A derangement is a permutation where no element appears in its original position.

    • Use the formula for derangements: !n = n! * (1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!)

    • Return the answer modulo (10^9 + 7) to handle large results.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 40 minutes
Round difficulty - Medium

Timing: 10:00 AM
Environment: Online (Webcam + Mic on)
The interviewer was friendly and to the point.

  • Q1. 

    Detect and Remove Loop in Linked List

    For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.

    Expected Complexity:

    A...

  • Ans. 

    Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.

    • Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

    • Once the loop is detected, use two pointers to find the start of the loop.

    • Adjust the pointers to remove the loop and return the modified linked list.

  • Answered by AI
  • Q2. 

    Spiral Order Traversal of a Binary Tree

    Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.

    Input:

    The input consists of a single line containing elem...
  • Ans. 

    The task is to output the Spiral Order traversal of a binary tree given in level order.

    • Implement a function that returns the spiral order traversal as a list

    • Traverse the binary tree in a spiral order alternating between left to right and right to left

    • Use a queue to keep track of nodes at each level

    • Handle null nodes represented by -1 in the input

  • Answered by AI
  • Q3. 

    Trapping Rainwater Problem Statement

    You are given an array ARR of long type, which represents an elevation map where ARR[i] denotes the elevation of the ith bar. Calculate the total amount of rainwater t...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped within given elevation map.

    • Iterate through the array to find the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water above each bar to get the total trapped water for the elevation map.

  • Answered by AI
Round 3 - HR 

Round duration - 20 minutes
Round difficulty - Easy

Timing (In Evening)
Environment (Same as Technical Interview)

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as Trainee Technology in GurgaonEligibility criteriaAbove 60% in B.Tech, B.Tech in CSE/ECE/ITNagarro interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, Operating Systems, DBMS, Computer NetworkTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : For DS and Algo, keep practicing every day on Leetcode, HackerEarth, and make a habit of participating in contests.
Tip 2 : Projects are vital in interviews, have at least 3 projects on Resume, in the field/profile which you're applying for.
Tip 3 : Give Mock Interviews.

Application resume tips for other job seekers

Tip 1 : Resume should be short and keep it under 1 page.
Tip 2 : Include skills that you're 100% confident in.
Tip 3 : Highlight your internships and projects section appropriately

Final outcome of the interviewSelected

Skills evaluated in this interview

Nagarro interview questions for designations

 Engineer Trainee

 (1)

 Associate Engineer Trainee

 (2)

 Trainee

 (13)

 Graduate Engineer Trainee (Get)

 (3)

 Technology Trainee

 (4)

 ASE Trainee

 (4)

 Associate Trainee

 (2)

 Project Trainee

 (1)

I was interviewed in Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Easy

It was an online coding round consisting of 3 questions conducted on Mettl platform. It started at 10:00 am and the test duration was of 90 mins. The questions were pretty easy of topics like arrays and strings.

  • Q1. 

    Nth Prime Number Problem Statement

    Find the Nth prime number given a number N.

    Explanation:

    A prime number is greater than 1 and is not the product of two smaller natural numbers. A prime number has exa...

  • Ans. 

    To find the Nth prime number given a number N, implement a function that returns the Nth prime number.

    • Create a function that takes N as input and returns the Nth prime number.

    • Iterate through numbers starting from 2 and check if each number is prime.

    • Keep track of the count of prime numbers found until reaching the Nth prime number.

    • Return the Nth prime number once it is found.

  • Answered by AI
  • Q2. 

    Count Palindrome Words in a String

    Given a string 'S' consisting of words, your task is to determine the number of palindrome words within 'S'. A word is considered a palindrome if it reads the same backw...

  • Ans. 

    Count the number of palindrome words in a given string.

    • Split the string into words using whitespace as delimiter.

    • Check each word if it is a palindrome by comparing it with its reverse.

    • Increment a counter for each palindrome word found.

    • Output the total count of palindrome words for each test case.

  • Answered by AI
  • Q3. 

    Distribute N Candies Among K People

    Explanation: Sanyam wishes to distribute 'N' candies among 'K' friends. The friends are arranged based on Sanyam's order of likeness. He initially distributes candies s...

  • Ans. 

    Distribute N candies among K people in Sanyam's order of likeness, incrementing distribution by K each round until all candies are distributed.

    • Distribute candies starting from 1st friend, incrementing by K each round

    • If remaining candies are fewer than what a friend is supposed to receive, stop distribution

    • Output the number of candies each friend ends up with at the end of distribution

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 20-30 minutes
Round difficulty - Easy

Interview was scheduled for 11:00 am and took around 20 mins. It was conducted on MS teams. The interviewer was polite and frank.
After the introduction he asked me some questions related to OOPS such as:
1. What are the principles of OOPS
2. What do you mean by polymorphism?
3. What is function overloading?
4. What are abstract classes and interface.

Then he gave me one coding question to solve. He told me to write the code on notepad and share screen.
question asked: Reverse the stack using recursion.

I was not able to solve this problem hence he gave me another question:
question: Reverse the linkedlist without using any extra space.

  • Q1. 

    Reverse Stack with Recursion

    Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...

  • Ans. 

    Reverse a given stack of integers using recursion without extra space or loop constructs.

    • Use recursion to pop all elements from the original stack and store them in function call stack.

    • Once the stack is empty, push the elements back in reverse order using recursion.

    • Ensure to handle base cases for empty stack or single element stack.

    • Example: If the input stack is [1, 2, 3], after reversal it should be [3, 2, 1].

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaBtech- CSE, IT and ECE and MCA. 60% in the current degree with one pending backlogNagarro interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, DBMS, Operating SystemsTime required to prepare for the interview - 2-3 monthsInterview preparation tips for other job seekers

Tip 1 : Leave the subject but never leave the topic
Tip 2 : Have good hold on DSA
Tip 3 : Always go through the interview experiences of the company and common interview questions

Application resume tips for other job seekers

Tip 1 : Never add false things on your resume
Tip 2 : Add atleast 2 projects

Final outcome of the interviewRejected

Skills evaluated in this interview

Get interview-ready with Top Nagarro Interview Questions

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Oops Concepts and Data Structure Questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Oops And Data Structure, Collection.

I applied via Campus Placement and was interviewed before Feb 2020. There were 6 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Was interviewed as fresher?
  • Q2. Written test conducted? with verbal ability test ? GD
  • Q3. How would u deal with a problematic situation when you are working in a team?
  • Q4. What are your plans about higher studies?

Interview Preparation Tips

Interview preparation tips for other job seekers - it was basic with apptiude test and attitiude test.

I applied via Company Website and was interviewed before Feb 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. They asked about dbms questions in the form of table formate
  • Q2. They asked code for some python program

Interview Preparation Tips

Interview preparation tips for other job seekers - Firstly they conducted computer based technical exam and then after qualifying that then we will go for face face interview and then lastly HR round will be held.

I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. Wap of bubble sort
  • Ans. 

    Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

    • Start from the first element and compare it with the next element

    • If the next element is smaller, swap them

    • Repeat this process for all elements in the array

    • Continue this process until no more swaps are needed

  • Answered by AI
  • Q2. Wap of prime number
  • Ans. 

    A program to print all prime numbers

    • Take input from user for range of numbers

    • Loop through the range and check if each number is prime

    • Print the prime numbers

  • Answered by AI
  • Q3. What is hashmap?
  • Ans. 

    Hashmap is a data structure that stores key-value pairs and allows constant time access to values based on their keys.

    • Hashmap uses a hash function to map keys to indices in an array.

    • Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.

    • Examples of hashmap implementations include Java's HashMap class and Python's dict type.

  • Answered by AI
  • Q4. What is inheritance
  • Ans. 

    Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.

    • Inheritance allows code reuse and promotes code organization.

    • The existing class is called the parent or superclass, and the new class is called the child or subclass.

    • The child class inherits all the properties and methods of the parent class and can also add new properties and methods.

    • For...

  • Answered by AI
  • Q5. Call by value and call by reference

Interview Preparation Tips

Interview preparation tips for other job seekers - Be yourself

Skills evaluated in this interview

I applied via Walk-in and was interviewed in Mar 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Introduction your self in interview

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview should be very easy and comfortable to the students. And be confident at the infront of interviewer
Contribute & help others!
anonymous
You can choose to be anonymous

Tell us how to improve this page.

HCLTech

Find your spark at a global tech company that values your every skill

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.4k Interviews
Accenture Interview Questions
3.8
 • 8.1k Interviews
Infosys Interview Questions
3.6
 • 7.5k Interviews
Wipro Interview Questions
3.7
 • 5.6k Interviews
Capgemini Interview Questions
3.7
 • 4.8k Interviews
Tech Mahindra Interview Questions
3.5
 • 3.8k Interviews
HCLTech Interview Questions
3.5
 • 3.8k Interviews
Genpact Interview Questions
3.8
 • 3.1k Interviews
LTIMindtree Interview Questions
3.8
 • 2.9k Interviews
DXC Technology Interview Questions
3.7
 • 795 Interviews
View all
Nagarro Technical Trainee Salary
based on 4 salaries
₹3 L/yr - ₹5.5 L/yr
30% more than the average Technical Trainee Salary in India
View more details

Nagarro Technical Trainee Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

4.0

Skill development

5.0

Work-life balance

4.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Associate Staff Engineer
2.9k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Staff Engineer
2.9k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Engineer
2.4k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Engineer
896 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Nagarro with

Deloitte

3.8
Compare

Cognizant

3.7
Compare

TCS

3.7
Compare

Accenture

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent