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

Nagarro Software Developer Interview Questions, Process, and Tips

Updated 20 Jan 2025

Top Nagarro Software Developer Interview Questions and Answers

  • Q1. Crazy Numbers Pattern Challenge Ninja enjoys arranging numbers in a sequence. He plans to arrange them in 'N' rows such that: The first row contains 1 number. The second ...read more
  • Q2. String Compression Problem Statement Ninja needs to perform basic string compression. For any character that repeats consecutively more than once, replace the repeated s ...read more
  • Q3. Ninja and the New Year Guests Problem Ninja has organized a new year party and wants to verify if the guests are programmers by challenging them with a coding task. As a ...read more
View all 105 questions

Nagarro Software Developer Interview Experiences

56 interviews found

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(5 Questions)

Round duration - 180 Minutes
Round difficulty - Medium

  • Q1. 

    Maximum Meetings Problem Statement

    Given the schedule of N meetings with their start time Start[i] and end time End[i], you need to determine which meetings can be organized in a single meeting room such ...

  • Ans. 

    Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.

    • Sort the meetings based on their end times.

    • Iterate through the sorted meetings and select the next meeting that does not overlap with the current meeting.

    • Keep track of the selected meetings and return their indices in the order they are organized.

  • Answered by AI
  • Q2. 

    K Subsets with Equal Sum Problem Statement

    Determine whether it is possible to partition an array ARR into K subsets, each having an equal sum.

    Example:

    Input:
    ARR = [3, 5, 2, 4, 4], K = 2
    Output:
    tr...
  • Ans. 

    Yes, it is possible to partition an array into K subsets with equal sum.

    • Check if the total sum of the array is divisible by K.

    • Use backtracking to try all possible combinations of subsets.

    • Keep track of visited elements to avoid repetition.

    • Example: ARR = [3, 5, 2, 4, 4], K = 2. Possible subsets: [4, 5] and [2, 3, 4].

  • Answered by AI
  • Q3. 

    Merge k Sorted Linked Lists

    You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of ...

  • Ans. 

    Merge k sorted linked lists into one single sorted linked list.

    • Create a min-heap to store the heads of all k linked lists.

    • Pop the smallest element from the heap and add it to the result list.

    • If the popped element has a next element, push it back to the heap.

    • Repeat until the heap is empty and return the merged sorted list.

  • Answered by AI
  • Q4. 

    Sort a "K" Sorted Doubly Linked List Problem Statement

    You are given a doubly linked list with 'N' nodes, where each node can deviate at most 'K' positions from its actual position in the sorted list. You...

  • Ans. 

    Sort a doubly linked list with nodes that can deviate at most K positions from their actual position in the sorted list.

    • Iterate through the doubly linked list and maintain a window of size K+1 to sort the elements within the window.

    • Use insertion sort within the window to sort the elements efficiently.

    • Repeat the process until the entire list is sorted.

    • Time complexity can be optimized to O(N*log(K)) using a priority queu

  • Answered by AI
  • Q5. 

    Duplicate Subtrees Problem Statement

    Given a binary tree, return the root values of all duplicate subtrees. Two subtrees are considered duplicate if they have the same structure with identical node values...

  • Ans. 

    Find root values of duplicate subtrees in a binary tree.

    • Traverse the tree in a bottom-up manner to identify duplicate subtrees.

    • Use a hashmap to store the subtree structure and count occurrences.

    • Return the root values of duplicate subtrees found.

    • Handle null nodes by using -1 in the input sequence.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 25 Minutes
Round difficulty - Medium

  • Q1. Can you explain the concept of keys in database management systems?
  • Ans. 

    Keys in database management systems are unique identifiers for rows in a table.

    • Keys are used to uniquely identify each record in a table.

    • Primary key is a unique identifier for a record in a table.

    • Foreign key is a field in one table that refers to the primary key in another table.

    • Composite key is a combination of multiple columns that uniquely identify a record.

    • Unique key ensures that all values in a column are unique.

  • Answered by AI
Round 3 - HR 

Round duration - 15 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonEligibility criteriaNo BacklogNagarro interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice data structures vigorously
Tip 2 : Do at least 3 projects
Tip 3 : Practice Atleast 250 Questions

Application resume tips for other job seekers

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(5 Questions)

Round duration - 240 Minutes
Round difficulty - Medium

Aptitude questions + 3 medium level Coding Problem + 2 hard level Coding problem

  • Q1. 

    Minimum Steps for a Knight to Reach Target

    Given a square chessboard of size N x N, you need to determine the minimum number of steps a Knight takes to reach a target position from its starting position.

    ...
  • Ans. 

    Find the minimum number of steps a Knight takes to reach a target position on a chessboard.

    • Use BFS algorithm to find the shortest path from knight's starting position to target position.

    • Consider all possible moves of the knight on the chessboard.

    • Keep track of visited positions to avoid revisiting them.

    • Return the minimum number of steps required to reach the target position.

  • Answered by AI
  • Q2. 

    Reverse Alternate K Nodes Problem Statement

    You are given a singly linked list of integers along with a positive integer 'K'. The task is to modify the linked list by reversing every alternate 'K' nodes o...

  • Ans. 

    Reverse every alternate K nodes in a singly linked list

    • Traverse the linked list and reverse every alternate K nodes

    • Handle cases where the number of nodes left is less than K

    • Ensure to properly link the reversed nodes back to the original list

  • Answered by AI
  • Q3. 

    K Sum Subset Problem Statement

    Given an array arr of size 'N' and an integer 'K', determine the maximum subset sum of the array that does not exceed 'K'.

    Example:

    Input:
    arr = [1, 3, 5, 9], K = 16
    Out...
  • Ans. 

    Find the maximum subset sum of an array that does not exceed a given integer K.

    • Use dynamic programming to solve this problem efficiently.

    • Iterate through all possible subsets of the array and keep track of the maximum sum that does not exceed K.

    • Consider the choice of including or excluding each element in the subset.

    • Optimize the solution by using memoization to avoid redundant calculations.

  • Answered by AI
  • Q4. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.

    • Iterate through the items and update the array based on whether including the current item would increase the total value.

    • The final element of the array will contain the maximum value that can be stolen within the wei

  • Answered by AI
  • Q5. 

    Complete String Problem Statement

    Given an array of strings A of size N, determine the longest complete string. A string is deemed complete if every prefix of the string also appears in the array. If mult...

  • Ans. 

    Given an array of strings, find the longest complete string where every prefix of the string also appears in the array.

    • Iterate through each string in the array and check if all its prefixes exist in the array.

    • Keep track of the longest complete string found so far, and return the lexicographically smallest one if multiple exist.

    • If no complete string is found, return 'None'.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

The interviewer asked me questions from DS algo. Questions were like tell me the time complexity of this code. I was also asked questions from my projects and some questions from DBMS. 
2 coding questions were given to me to solve

  • Q1. 

    Count Derangements Problem Statement

    You are tasked with finding the total number of derangements for a given set of elements. Specifically, for an integer N, determine how many ways there are to permute ...

  • Ans. 

    Count the total number of derangements for a given set of 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!).

    • Calculate the derangements modulo 10^9 + 7 to handle large numbers efficiently.

  • Answered by AI
  • Q2. 

    Coin Game Winner Problem Statement

    Two players 'X' and 'Y' are participating in a coin game. Starting with 'N' coins, players alternate turns, with 'X' starting first. On each turn, a player has three cho...

  • Ans. 

    Determine the winner of a coin game where players take turns picking coins optimally.

    • Players take turns picking 'A', 'B', or 1 coin each turn

    • The player unable to make a move loses

    • Implement a function to determine the winner based on the given inputs

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPANagarro interview preparation:Topics to prepare for the interview - Data Structures, DBMS , OOPS, System Design, Algorithms, Dynamic Programming.Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice At least 250 Questions of DS algo
Tip 2 : Do at least 2 application based projects
Tip 3 : Practice questions with optimized approaches

Application resume tips for other job seekers

Tip 1 : Have some applicayion based projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Project should clear and crisp

Final outcome of the interviewRejected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I was interviewed before Apr 2023.

Round 1 - Technical 

(2 Questions)

  • Q1. Java 8 features
  • Q2. Solid design principles
  • Ans. 

    Solid design principles are fundamental guidelines for designing software that are focused on maintainability, scalability, and reusability.

    • Solid design principles include Single Responsibility Principle, Open/Closed Principle, Liskov Substitution Principle, Interface Segregation Principle, and Dependency Inversion Principle.

    • These principles help in creating software that is easier to maintain, extend, and test.

    • For exa...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn solid design principles
Java 8 features
Multithreading
Design pattern

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 180 minutes
Round difficulty - Medium

There were total 4 coding questions
1 -> Backtracking
2 -> Recursion
3 -> Greedy
4- > Graphs

  • Q1. 

    Print All Paths Problem Statement

    In this problem, you are provided with a graph consisting of 'N' nodes and 'M' unidirectional edges. Additionally, two integers 'S' and 'D' are given, representing the so...

  • Ans. 

    The task is to find all unique paths from a source node to a destination node in a graph.

    • Identify all unique paths from source node to destination node in a graph

    • Ensure all nodes in the path are unique

    • Output total number of valid paths and list nodes in each path in lexicographical order

  • Answered by AI
  • Q2. 

    Maximum Meetings Problem Statement

    Given the schedule of N meetings with their start time Start[i] and end time End[i], you need to determine which meetings can be organized in a single meeting room such ...

  • Ans. 

    Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.

    • Sort the meetings based on their end times.

    • Iterate through the sorted meetings and select the next meeting that does not overlap with the current meeting.

    • Keep track of the selected meetings and return their indices in the order they are organized.

  • Answered by AI
  • Q3. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight 'W' in their knapsack. The store contains 'N' items, each with a known weight and value. Given these constr...

  • Ans. 

    The 0/1 Knapsack Problem involves maximizing profit by selecting items with known weights and values to fit within a knapsack of limited capacity.

    • Create a 2D array to store the maximum profit that can be achieved for each item and weight combination.

    • Use dynamic programming to iteratively fill the knapsack with items, considering whether to include each item or not.

    • The final value in the 2D array will represent the maxi...

  • Answered by AI
  • Q4. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use depth-first search (DFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge cases such as out of bounds indi

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

there were total 2 coding questions asked
one was from 2 pointer and another was from Binary Tree

  • Q1. 

    Rearrange Array: Move Negative Numbers to the Beginning

    Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...

  • Ans. 

    Yes, this can be achieved by using the two-pointer approach to rearrange the array in-place with O(1) auxiliary space.

    • Use two pointers, one starting from the beginning and one from the end of the array.

    • Swap elements at the two pointers if they are not in the correct order (negative before positive).

    • Continue this process until the two pointers meet in the middle of the array.

  • Answered by AI
  • Q2. 

    Maximum Path Sum Between Two Leaves

    Given a non-empty binary tree where each node has a non-negative integer value, determine the maximum possible sum of the path between any two leaves of the given tree.

    ...
  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes

    • Keep track of the maximum sum as you traverse the tree

    • Consider all possible paths that pass through the root and those that do not

    • Handle cases where there is only one leaf node in the tree

  • Answered by AI

Interview Preparation Tips

Eligibility criteria7Nagaaro interview preparation:Topics to prepare for the interview - DSA , OOPS , OS, CN, Algorithms, DBMS , Dynamic Programming , GraphsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Do DSA
Tip 2 : Do Extra Subjects
Tip 3 : Prepare some Projects

Application resume tips for other job seekers

Tip 1 : Do Mention coding profiles in resume
Tip 2 : Do add summary of Projects

Final outcome of the interviewRejected

Skills evaluated in this interview

Nagarro interview questions for designations

 Software Developer Intern

 (6)

 Senior Software Developer

 (3)

 Associate Software Developer

 (2)

 Junior Software Developer

 (1)

 Lead Software Developer

 (1)

 Developer

 (1)

 Software Engineer

 (29)

 Senior Software Developer 2

 (1)

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(3 Questions)

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.There was a 1 hour gap b/w the two tests.

  • Q1. 

    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 as output.

  • Answered by AI
  • Q2. 

    K - Sum Path In A Binary Tree

    Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...

  • Ans. 

    Find all paths in a binary tree with nodes summing up to a given value K.

    • Traverse the binary tree and keep track of the current path and its sum.

    • At each node, check if the sum equals K and store the path if true.

    • Recursively explore left and right subtrees while updating the path and sum.

    • Return the list of paths that sum up to K in the binary tree.

  • Answered by AI
  • Q3. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithms round where I was asked to solve 2 coding problems explaining my approach with proper Complexity Analysis . After the coding questions were over there was some time left so the interviewer asked me some concepts related to DBMS.

  • Q1. 

    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
  • Q2. 

    Next Permutation Problem Statement

    You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...

  • Ans. 

    Given a permutation of 'N' integers, rearrange the numbers to form the lexicographically next greater permutation.

    • Iterate from right to left to find the first element that is smaller than the element to its right.

    • Swap this element with the smallest element to its right that is greater than it.

    • Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.

    • If no such elemen...

  • Answered by AI
  • Q3. Can you explain indexing in databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

    • Types of indexes include B-tree, hash, and bitmap indexes.

    • Indexes can improve the performance of SELECT queries but may slow down INSERT, UPDATE, and DELETE operation...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

This round was also held on Google Meet where I was supposed to code 2 problems in a Google Doc. After the coding questions , I was asked some core concepts related to OS .

  • 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. 

    Given an array of integers and a target, find all pairs of elements that add up to the 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.

    • Handle cases where the same element is used twice to form a pair.

    • Return (-1, -1) if no pair is found.

  • Answered by AI
  • Q2. 

    Convert Sentence Problem Statement

    Convert a given string 'S' into its equivalent representation based on a mobile numeric keypad sequence. Using the keypad layout shown in the reference, output the seque...

  • Ans. 

    Convert a given string into its equivalent representation based on a mobile numeric keypad sequence.

    • Iterate through each character in the input string and map it to its corresponding numeric keypad sequence.

    • Use a dictionary to store the mapping of characters to numeric sequences.

    • Handle lowercase characters only and ignore special characters, capital letters, and spaces.

  • Answered by AI
  • Q3. What do you mean by FCFS?
  • Ans. 

    FCFS stands for First-Come, First-Served. It is a scheduling algorithm where tasks are executed in the order they arrive.

    • FCFS is a non-preemptive scheduling algorithm.

    • Tasks are executed in the order they arrive in the queue.

    • It is simple to understand and implement.

    • Example: Consider a printer queue where print jobs are processed in the order they are submitted.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPANagarro interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, DBMS, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Nagarro Interview Questions

I was interviewed in Jul 2021.

Round 1 - Coding Test 

(3 Questions)

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.There was a 1 hour gap b/w the two tests.

  • 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 finding the number of distinct ways to climb to the Nth stair by climbing one or two steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Implement modulo operation to avoid overflow while calculating the result.

    • ...

  • Answered by AI
  • Q2. 

    Equilibrium Index Problem Statement

    Given an array Arr consisting of N integers, your task is to find the equilibrium index of the array.

    An index is considered as an equilibrium index if the sum of elem...

  • Ans. 

    Find the equilibrium index of an array where sum of elements on left equals sum on right.

    • Iterate through array to calculate prefix and suffix sums

    • Compare prefix and suffix sums to find equilibrium index

    • Return -1 if no equilibrium index is found

  • Answered by AI
  • Q3. 

    Closest Perfect Square Problem Statement

    Given a positive integer 'N', determine the perfect square number closest to 'N' and the number of steps required to reach that perfect square.

    Example:

    Input:
    ...
  • Ans. 

    Given a positive integer 'N', find the closest perfect square number and the steps required to reach it.

    • Find the square root of N and round it to the nearest integer to get the closest perfect square.

    • Calculate the difference between the closest perfect square and N to get the number of steps required.

    • Return the closest perfect square and the number of steps as output.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

This round had 2 questions where I had to first explain my approach with proper complexity analysis and then write the pseudo code for the same.

  • Q1. 

    Find the Longest Palindromic Substring

    Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.

    If there are multiple longest palin...

  • Ans. 

    Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found and its starting index

    • Return the substring starting from the index of the longest palindrome found

  • Answered by AI
  • Q2. 

    Validate BST Problem Statement

    Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.

    A binary search tree (BST)...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

    • Use level order traversal to construct the binary tree from input data.

  • Answered by AI
Round 3 - Video Call 

(4 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round also had 2 questions from DS/Algo which were followed by some questions from DBMS and SQL.

  • Q1. 

    Nearest Numbers with the Same Number of Set Bits

    Given a positive integer n, your task is to determine the next smallest integer and the previous largest integer that have the same number of '1' bits in t...

  • Ans. 

    Given a positive integer, find the next smallest and previous largest integers with the same number of set bits in their binary representation.

    • Count the number of set bits in the binary representation of the given integer 'n'.

    • Find the next smallest integer by iterating from 'n+1' onwards and checking for the same number of set bits.

    • Find the previous largest integer by iterating from 'n-1' downwards and checking for the

  • Answered by AI
  • Q2. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a HashSet to store seen elements.

  • Answered by AI
  • Q3. What are the advantages of using views in a database management system?
  • Ans. 

    Views in a database management system provide security, simplify complex queries, and improve performance.

    • Enhanced security by restricting access to certain columns or rows

    • Simplify complex queries by pre-defining joins and filters

    • Improve performance by storing frequently used queries as views

    • Reduce redundancy by storing common logic in views

  • Answered by AI
  • Q4. What are constraints in SQL?
  • Ans. 

    Constraints in SQL are rules and restrictions applied to columns in a table to enforce data integrity.

    • Constraints ensure data accuracy and consistency in a database.

    • Common constraints include NOT NULL, UNIQUE, PRIMARY KEY, FOREIGN KEY, and CHECK constraints.

    • NOT NULL constraint ensures a column cannot have a NULL value.

    • UNIQUE constraint ensures all values in a column are unique.

    • PRIMARY KEY constraint uniquely identifies...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPANagarro interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1.  what is theConcept of oops language
  • Ans. 

    OOPs is a programming paradigm based on the concept of objects, which can contain data and code.

    • OOPs stands for Object-Oriented Programming.

    • It focuses on creating objects that interact with each other to solve a problem.

    • It uses concepts like inheritance, encapsulation, and polymorphism.

    • Inheritance allows a class to inherit properties and methods from another class.

    • Encapsulation is the practice of hiding data and method...

  • Answered by AI
  • Q2. What is constructor and destructor and also explain its working
  • Ans. 

    Constructor and destructor are special member functions in a class that are used to initialize and destroy objects respectively.

    • Constructor is called when an object is created and is used to initialize the object's data members.

    • Destructor is called when an object is destroyed and is used to free up any resources that the object was using.

    • Constructor has the same name as the class and no return type, while destructor ha...

  • Answered by AI
  • Q3. What is polymorphism and explain in brief?
  • Ans. 

    Polymorphism is the ability of an object to take on many forms.

    • Polymorphism allows objects of different classes to be treated as if they are of the same class.

    • It is achieved through method overriding and method overloading.

    • Example: A parent class Animal can have child classes like Dog, Cat, and Cow. All these child classes can have a method called 'makeSound', but each class can have a different implementation of the m...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - We should be covered topicwise revision deeply

Skills evaluated in this interview

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(4 Questions)

  • Q1. Detailed questions on Java- Strings code, exception handling and basic Oop
  • Q2. Detailed questions on Mysql
  • Q3. Detailed questions on Java 8
  • Q4. Detailed questions on Spring
Round 3 - HR 

(5 Questions)

  • Q1. What are your salary expectations?
  • Q2. Share details of your previous job.
  • Q3. Why should we hire you?
  • Q4. What are your strengths and weaknesses?
  • Q5. Tell me about yourself.
Round 4 - HR 

(1 Question)

  • Q1. Why should we hire you?

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare very well for Technical
Round 1 - Coding Test 

Apti and Coding test...quite good level.

Round 2 - One-on-one 

(1 Question)

  • Q1. Interview is of high skill . Should brush everything.

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush up everything. Go with confidence.

I was interviewed before May 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

This round was also conducted on Metll platform. This round is totally based on coding. There are so many choices in language, so you can easily select the language in which you are comfortable in. There are three problems to solve. I choose Java 8 to solve the problems. The problems are ranging from easy to hard-

To find the maximum occurring character in a given string.
To find the factorial of a given number.
Count Derangements.

  • Q1. 

    Count Derangements

    Determine the number of derangements possible for a set of 'N' elements. A derangement is a permutation where no element appears in its original position.

    Input:

    An integer 'T' repres...
  • Ans. 

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

    • Derangements are permutations where no element appears in its original position.

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

    • Calculate the derangements modulo (10^9 + 7) for each test case.

  • Answered by AI
  • Q2. 

    Factorial Calculation Problem Statement

    Develop a program to compute the factorial of a given integer 'n'.

    The factorial of a non-negative integer 'n', denoted as n!, is the product of all positive integ...

  • Ans. 

    Program to compute factorial of a given integer 'n', with error handling for negative values.

    • Create a function to calculate factorial using a loop or recursion

    • Check if input is negative, return 'Error' if true

    • Handle edge cases like 0 and 1 separately

    • Use long data type to handle large factorials

  • Answered by AI
  • Q3. 

    Most Frequent Word Problem Statement

    You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...

  • Ans. 

    Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.

    • Split strings 'A' and 'B' into words

    • Count frequency of each word in 'A'

    • Check if word is not in 'B' and is the most frequent and lexicographically smallest

    • Return the word or -1 if no such word exists

  • Answered by AI
Round 2 - Video Call 

Round duration - 90 Minutes
Round difficulty - Easy

The interviewer was so polite. He firstly asks me to describe myself and then ask about my family. After that he ask which language I choose to solve problems in Coding round and why I choose that language. Then he started to ask the technical questions.

Interview Preparation Tips

Eligibility criteria7 CGPANagarro interview preparation:Topics to prepare for the interview - Data Structures, Competitive Programming, Databases, Java, Spring , Hibernate, Jenkins, AWSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts

Application resume tips for other job seekers

Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand

Final outcome of the interviewSelected

Skills evaluated in this interview

Nagarro Interview FAQs

How many rounds are there in Nagarro Software Developer interview?
Nagarro interview process usually has 2-3 rounds. The most common rounds in the Nagarro interview process are Technical, Aptitude Test and HR.
What are the top questions asked in Nagarro Software Developer interview?

Some of the top questions asked at the Nagarro Software Developer interview -

  1. Difference between High severity and low severity with example, what is importa...read more
  2. Make a 3*3 cube where you need to fill the numbers using 1-9, rows, columns and...read more
  3. An array contain 6 different numbers, only 1 number is repeated for 5 times. So...read more
How long is the Nagarro Software Developer interview process?

The duration of Nagarro Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.

Tell us how to improve this page.

Nagarro Software Developer Interview Process

based on 39 interviews

5 Interview rounds

  • Technical Round - 1
  • Technical Round - 2
  • HR Round - 1
  • HR Round - 2
  • Personal Interview1 Round
View more
Nagarro Software Developer Salary
based on 309 salaries
₹3.8 L/yr - ₹15 L/yr
11% more than the average Software Developer Salary in India
View more details

Nagarro Software Developer Reviews and Ratings

based on 70 reviews

4.0/5

Rating in categories

3.9

Skill development

4.2

Work-life balance

3.7

Salary

3.5

Job security

4.0

Company culture

3.7

Promotions

3.7

Work satisfaction

Explore 70 Reviews and Ratings
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