Nagarro Interview Experience

You are given a Binary Tree. Return the length of the diameter of the tree. Note : The diameter of a binary tree is the length of the longest path between any two end nodes in a tree. The number of edges between two nodes represents the length of the path between them. Example : Input: Consider the given binary tree: Output: 6 Explanation: Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6. Input Format: The only line contains elements in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 in its place. For example, the input for the tree depicted in the below image will be: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Explanation : Level 1 : The root node of the tree is 1 Level 2 : Left child of 1 = 2 Right child of 1 = 3 Level 3 : Left child of 2 = 4 Right child of 2 = null (-1) Left child of 3 = 5 Right child of 3 = 6 Level 4 : Left child of 4 = null (-1) Right child of 4 = 7 Left child of 5 = null (-1) Right child of 5 = null (-1) Left child of 6 = null (-1) Right child of 6 = null (-1) Level 5 : Left child of 7 = null (-1) Right child of 7 = null (-1) The first not-null node(of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on. The input ends when all nodes at the last level are null(-1). The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Output Format: Return a single integer i.e. the diameter of the tree. Note : You do not need to print anything; it has already been taken care of. Just implement the given function.

Find Minimum Number Of Coins

Given an infinite supply of Indian currency i.e. [1, 2, 5, 10, 20, 50, 100, 500, 1000] valued coins and an amount 'N' . Find the minimum coins needed to make the sum equal to 'N'. You have to return the list containing the value of coins required in decreasing order. For Example For Amount = 70, the minimum number of coins required is 2 i.e an Rs. 50 coin and a Rs. 20 coin. Note It is always possible to find the minimum number of coins for the given amount. So, the answer will always exist. Input Format The only line contains a single integer ‘N’ representing the amount. Output Format The only line contains the list containing the value of coins required in decreasing order. Note You do not need to print anything, it has already been taken care of. Just implement the given function.

Largest rectangle in a histogram

You have been given an array/list 'HEIGHTS' of length ‘N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of the histogram bar. Consider that the width of each histogram is 1. You are supposed to return the area of the largest rectangle possible in the given histogram. For example : In the below histogram where array/list elements are {2, 1, 5, 6, 2, 3}. The area of largest rectangle possible in the given histogram is 10. Input format : The first line contains a single integer ‘T’ denoting the number of test cases. The first line of each test case contains a single integer ‘N’ denoting the number of elements in the array/list. The second line contains ‘N’ single space-separated integers denoting the elements of the array/list. Output format : For each test case, print an integer denoting the area of the largest rectangle possible in the given histogram. Note : You do not need to print anything; it has already been taken care of. Just implement the given function. Constraints : 1 <= T <= 10 1 <= N <= 10^6 0 <= HEIGHTS[i] <= 10^9 Where ‘T’ is the number of test cases. 'N' is the length of the given array/list. And, HEIGHTS[i] denotes the height of the 'ith' histogram bar. Time Limit: 1 sec.

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" . Return true if the given string 'S' is balanced, else return false. For example: 'S' = "{}()". There is always an opening brace before a closing brace i.e. '{' before '}', '(' before '). So the 'S' is Balanced. Input Format: The first and only input line contains a string 'S'. Output format : The only line of output contains 'Balanced' or 'Not Balanced'. Note: You are not required to print anything explicitly. It has already been taken care of. Just implement the given function.

State Management

Different ways to manage state; what is Redux; reducers, selectors, and dispatch; how to build a GET API; how to integrate an API; and different ways to integrate APIs in the frontend.

OOP Concepts

What is the static keyword , and what is runtime polymorphism?

Cycle Detection in a Singly Linked List

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false. A cycle occurs when a node's next points back to a previous node in the list. Example: In the given linked list, there is a cycle, hence we return true. Input format : The first line of each test case contains the elements of the singly linked list separated by a single space and terminated by -1. Hence -1 would never be a list element. The second line contains the integer position 'pos', representing the position (0-indexed) in the linked list where the tail connects. If 'pos' is -1, there is no cycle in the linked list. Output format : The only output line contains 'true' if the linked list has a cycle or 'false' otherwise. Note : You don't have to print by yourself explicitly. It has been taken care of.

Explain any of your projects. What are your technical strengths and weaknesses? If you are given an opportunity to switch your career from software engineering to consulting after five years, would you take it? What is your tech stack? Do you have any questions for me?

Key Preparation Tips

Prepare DSA thoroughly.

Practice aptitude and puzzle-based questions.

Have at least two good projects on your resume.

Be prepared to explain your projects clearly.

Practice coding problems involving Arrays, Binary Search, DP and Recursion.

Prepare common HR questions such as Tell me about yourself and Who is your role model?