IDeaS Revenue Solutions Software Developer Intern Interview Questions and Answers

DSA questions of array and strings

Q1. DSA on array advanced topics
Add your answer

Moderate difficulty level questions were asked

High difficulty level questions were asked

Round duration - 30 Minutes
Round difficulty - Easy

he interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.

Q1. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal to find connected components in an undirected and disconnected graph.
• Use Depth First Search (DFS) algorithm to traverse the graph and find connected components.

• Maintain a visited array to keep track of visited vertices.

• For each unvisited vertex, perform DFS to explore all connected vertices and form a connected component.
Answered by AI
Add your answer
Q2. 
Median of Two Sorted Arrays
Given two sorted arrays A and B of sizes N and M, find the median of the merged array formed by combining arrays A and B. If the total number of elements, N + M, is even, the m...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 120 mintues
Round difficulty - Medium

Aptitude round was in afternoon around 3 pm and every person who has given aptitude round was also given an other chance which was coding round. There was a time gap of 1 hr between two test. both of these went online. Environment was good without any lag. Webcam was on throughout the test. There were 3 coding questions, of which 2 were medium and one was easy. I attempted all of them.

Q1. 
String Rotation Problem Statement
You are given a string named str and an integer D. Your task is to perform both left (anticlockwise) and right (clockwise) rotations on the given string by D units, start...read more
Ans. 
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'.
Answered by AI
Add your answer
Q2. 
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...read more
Ans. 
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.
Answered by AI
Add your answer
Q3. 
Common Elements Problem Statement
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
Input:
The first line contains an integer 'T' representin...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

This round was at 12 pm. Interviewer and I greeted each other and then he asked me to explain all the questions I had done during test. He shared screen with my report of test which was having the solutions I typed during coding rounds. It took around 20 minutes to explain all three questions. Interviewer was happy with my explanation. Then he had asked me one coding question and various questions based on my project. I answered him all with a smile.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in afternoon. HR called to me to fix a meeting on Microsoft teams. He was very polite with experience of corporate environment.

Round duration - 90 minutes
Round difficulty - Medium

This round contains 40 mcq questions 15 dsa and 25 aptitude.
then there was 5 coding questions.

Q1. 
Check If Binary Representation of a Number is Palindrome
Given an integer N, determine if its binary representation is a palindrome.
Input:
The first line contains a single integer ‘T’ representing the ...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Word Break Problem Statement
You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.
The strings from A c...read more
Ans. 
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 oth
Answered by AI
Add your answer

Round duration - 25 minutes
Round difficulty - Easy

Technical Round

Q1. 
Sort 0 and 1 Problem Statement
Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...read more
Ans. 
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.
Answered by AI
Add your answer

Normal MCQ style questions involving basic concepts

2 coding questions: 1st one average, 2nd one slightly better than average.

Q1. Conceptual questions involving linked list, sorting, and various other general topics.
Add your answer

Q1. Your introduction
Add your answer
Q2. Normal conversation about various random topics (HR was trying to check my communication ability)
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

Q1. 
LRU Cache Task Description
Design and implement a data structure for a Least Recently Used (LRU) cache to support two operations:
1. get(key) - Returns the value for the given key if it exists in the cac...read more
Ans. 
Design and implement a Least Recently Used (LRU) cache data structure supporting get and put operations with specified constraints.
• Implement a data structure for LRU cache with get and put operations

• Maintain a capacity limit and remove least recently used item when exceeding capacity

• Handle get operation by returning value for given key or -1 if key does not exist

• Handle put operation by inserting or updating key-value p...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Hard

Round duration - 15-20 minutes
Round difficulty - Easy

Q1. Can you tell me about yourself and describe some condition-based questions you were asked?
Add your answer