IDeaS Revenue Solutions Software Developer Intern Interview Questions and Answers

Moderate difficulty level questions were asked

High difficulty level questions were asked

Round duration - 45 Minutes
Round difficulty - Easy

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. Brute Force
• The most obvious brute force approach would be to sort the array in descending order and return the ‘K’th element from the beginning of the array.
• Sort the array in descending order, for sorting most of the languages have their inbuilt sort methods which are usually very fast.
• After sorting, return the element arr['K'-1](i.e. element at index ‘K’-1, considering 0-based indexing).
Space Complexity: O(1)Explanati...read more
Answered Anonymously
Add your answer
Q2. Can you draw an E-R Diagram for Uber?
Add your answer
Q3. 
Maximum Sum Path from Leaf to Root
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
Example:
All the possibl...read more
Ans. Recursive Subproblem
The idea here is that we will do a recursive solution by asking the children of the current node for the max sum path and then choose the path with the max sum. 
 
The approach will be as follows:
1. Get the max sum path for the left subtree.
2. Get the max sum path for the right subtree.
3. Select the one with the max sum from both and insert current node's data into it.
4. Return the updated path.
    
Al...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Q1. 
Add Two Numbers Represented as Linked Lists
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...read more
Ans. Recursion
• A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
• The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
• As the linked lists represent the numbers in reverse order, the LSD occurs at...read more
Answered Anonymously
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

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 binary conversion of given number is palindrome or not. Ex: 6 (0110) is palindrome.
I used a recursive function for binary conversion and then check for palindrome using a loop. Refrain from using inbuilt functions as they wanna check your logic. O(n) time complexity.
Answered Anonymously
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. 
 One Sentence (string) is given. find out the words, that has length even and greater than equal to 4 (e.g. 4,6,8.. etc.) and separate them with space.
e.g. Given String : “abcd abc abcde abcdef”
Output: “ab cd abc abcde abc def”
I allocated a new string dynamically, and used two for loops to copy one string to another, adding a space at the middle of the word where word length was >=4 and even. O(n^2) time comple
Answered Anonymously
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. 
Then he made it complex by saying that if there are numbers from 0 to k in an array of size n then how will you sort them in O(n), I told him the count sort, he agreed with it and then asked me to quickly write down the code, I wrote it down, there was a silly mistake which he pointed out and said that it’s good and then moved on to next problem. He saw my code for fourth largest in an array, I did it using heap and ti...read more
Answered Anonymously
Add your answer