10+ Nagarro Software Developer Intern Interview Questions and Answers

Check if the binary representation of a number is a palindrome.

• Convert the integer to binary representation.

• Check if the binary representation is a palindrome by comparing it with its reverse.

• Return true if it is a palindrome, false otherwise.

Sort an array of 0s and 1s in linear time without using additional arrays.

• Use two pointers approach to swap 0s to the left and 1s to the right.

• Maintain two pointers, one for 0s and one for 1s, and iterate through the array.

• Swap elements at the two pointers based on the values encountered.

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

Implement left and right string rotations by D units on a given string.

• Implement leftRotate() function to return string after left rotation by D units.

• Implement rightRotate() function to return string after right rotation by D units.

• Consider handling edge cases like empty string or D exceeding string length.

• Example: For input 'coding', D=2, leftRotate() should return 'dingco' and rightRotate() should return 'ngcodi'.

Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.

• Iterate through all possible combinations of strings from the list to check if they can form the target string.

• Use recursion to try different combinations of strings.

• Keep track of the current position in the target string and the strings used so far.

• Return true if the target string can be formed, false otherwise.

Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.

• Use Kadane's algorithm to find the maximum subarray sum efficiently.

• Initialize two variables, one for current sum and one for maximum sum.

• Iterate through the array and update the current sum and maximum sum accordingly.

• Return the maximum sum as the result.

Calculate the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.

• Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.

• The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.

• Consider edge cases like a single node tree or empty tree when calculating the height.

Count the total number of unique pairs in an array whose elements sum up to a given value.

• Use a hashmap to store the frequency of each element in the array.

• Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

• Increment the count of pairs if the complement exists in the hashmap.

• Divide the count by 2 to avoid counting duplicates (arr[i], arr[j]) and (arr[j], arr[i]) separately.

The task is to find and output the common strings present in both given arrays of lowercase alphabets for each test case.

• Iterate through the elements of the second array and check if they are present in the first array.

• Use a hash set or map to efficiently check for common elements.

• Return the common strings in the order they appear in the second array.

Find the median of two sorted arrays by merging them and calculating the middle element(s).

• Merge the two sorted arrays into one sorted array.

• Calculate the median based on the total number of elements in the merged array.

• If the total number of elements is even, take the mean of the two middle elements as the median.

Identify all prime numbers less than or equal to a given positive integer N.

• Iterate from 2 to N and check if each number is prime

• Use the Sieve of Eratosthenes algorithm for efficient prime number identification

• Optimize by only checking up to the square root of N for divisors