CoLeague Solutions Software Developer Intern Interview Questions and Answers

Moderate difficulty level questions were asked

High difficulty level questions were asked

Q1. I dont remember
Add your answer
Q2. Trees based question
Add your answer
Q3. Palindromic subsequence based
Add your answer

DSA questions of array and strings

Q1. DSA on array advanced topics
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

There were 3 coding questions. All of them were pretty easy and solvable in less than 30 minutes. Some string and pattern matching + some number theory problems were there.

Q1. Arithmetic Expression Evaluation
You are given a string ‘expression’ consists of characters ‘+’, ‘-’, ‘*’, ‘/’, ‘(‘, ‘)’ and ‘0’ to ‘9’, that represents an Arithmetic Expression in Infix Notation. Your ...read more
Ans. Reverse Polish Notation
Infix Expressions are harder for Computers to evaluate because of the additional work needed to decide precedence, so we first convert infix expressions into either postfix or prefix expressions.  In this approach, we convert Infix expression into Postfix expression also known as Reverse Polish Notation, and then evaluate the postfix expression using stack.  Note in postfix expression, ...read more
Answered Anonymously
Add your answer
Q2. Maximum Product Subarray
You are given an array “arr'' of integers. Your task is to find the contiguous subarray within the array which has the largest product of its elements. You have to report t...read more
Ans. Brute-force
Steps:
1. Create an ans variable and initialize it to INT_MIN.
2. Run a loop i = 0 to N and do:
   • Run a loop j = i to N and do:
     • Create a variable, say currentProduct and initialize it to 1.
     • Run a loop k = i to j and do:
       • currentProduct = currentProduct * arr[k]
       • Store the maximum of ans and the currentProduct in the ans variable.
3. Finally, return the ans variable.
Space Complexity: O(1)Explanation:
O(1)
 
Constant space is u...read more
Answered Anonymously
Add your answer
Q3. Angle between hour hand and minute hand
Given the time in hours and minutes, you need to calculate the angle between the hour hand and the minute hand.
Note :
There can be two angles between the hour han...read more
Ans. Using reference time
• The idea is to take the 12:00 i.e. H = 12  and M = 0 as reference time.
• First,  calculate the angle made by the hour hand with respect to 12:00 in H hours and M minutes. In 12 hours the hour hand moves by 360 degrees i.e. 30 degrees in 1 hour and 0.5 degrees in 1 minute. So in H hours and M minutes, the angle moved by hour hand is  0.5 * (H * 60 + M).
• Then, calculate the angle made by m...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This was a technical round. First after properly introducing ourselves(me and the interviewer), we started with the main interview. I was asked 2 questions, one DS and Algorithms and the other System Design question.

Q1. Sibling Nodes
You have been given a Binary Tree of ‘N’ nodes, where the nodes have integer values. Your task is to print all nodes that don’t have a sibling node.
Note:
1. Node ‘U’ is said to be a siblin...read more
Ans. DFS Approach
The idea here is to use the fact that if a node of the binary tree has two child nodes, then both of them will be siblings to each other, and if a node of the binary tree has only one child, then that child will not have any sibling.
Example 
In above figure 1 has two children, so nodes 3 and 4 are siblings to each other. Also, 3 has only one child, i.e., 5 and 5 have no sibling node.

So, we will use a df...read more
Answered Anonymously
Add your answer
Q2. System Design
Design a elevator in a single building with N floors.
Ans. 
Tip 1 : Discuss first about how the product(here, elevator) will function.
Tip 2 : Start making with the most basic classes for the elevator.
Tip 3 : One by one after making the basic class, add new functionalities to it, taking care of all corner cases.
Answered Anonymously
Add your answer

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 in the unsorted array
You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.
E...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. System Design Question
Draw E-R Diagram for Uber.
Add your answer
Q3. Maximum sum path from the leaf to root
You are given a binary tree of 'N' nodes.
Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the roo...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 As Linked Lists
You are given two linked lists representing two non-negative numbers. The digits in the linked list are stored in reverse order, i.e. starting from least significant digit (...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 - 120 minutes
Round difficulty - Medium

It was in the morning. It had basic questions and 2 programming questions(1 string and 1 Data Structure)

Q1. Character Pattern
Print the following pattern for the given N number of rows.
Pattern for N = 4
A
BC
CDE
DEFG
Input format :
Integer N (Total no. of rows)
Output format :
Pattern in N lines
Const...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q2. Stack using queue
Implement a Stack Data Structure specifically to store integer data using two Queues.
There should be two data members, both being Queues to store the data internally. You may use the i...read more
Ans. Approach 1
• This method ensures that every new element entered in the queue ‘q1’ is always at the front.
• Hence, during pop operation, we just dequeue from ‘q1’.
• For this, we need another queue ‘q2., which is used to keep every new element to the front of ‘q1’.
• During push operation :
  • Enqueue new element ‘x’ to queue ‘q2’.
  • One by one, dequeue everything from ‘q1’ and enqueue to ‘q2’.
  • Swap the names of ‘q1’ and ‘q2’.
• During pop o...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

My interviewer asked me about my projects and the concepts involved in making it. Then he asked me to solve a string problem which was not very difficult followed by basic questions on array and it's properties. He also asked HTML tags.

Q1. Reverse the String
You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.
For example:
 If the given string is: STR...read more
Ans. Optimal Solution
• Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
• Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only constant extra space is required.
Time Complexity: O(...read more
Answered Anonymously
Add your answer

Round duration - 150 minutes
Round difficulty - Easy

This round for Sapient was based on it's core values and how I've implemented these once or more in life. It mostly involved discussion around my leadership, team player, problem solving and innovative skills as a part of the clubs in college. Also, what are my expectations from Sapient and what I bring to them

DSA algorithms array linkedlist strings dp

Q1. Merge 2 sorted linked list
Ans. 
Merge 2 sorted linked lists into a single sorted linked list
• Create a new linked list to store the merged result

• Compare the values of the nodes from both lists and add the smaller one to the result list

• Move the pointer of the list with the smaller value to the next node and repeat until both lists are empty
Answered by AI
Add your answer

Q1. 1.Self introduction 2.question about my department(ex ECE) 3.oops (polymorphism,inheritance,encapsulation) 4.programming C language because i preferred factorial of given number using recursion ...read more
Add your answer

Q1. Just a formalities of checking address aadhar no mobile num thats all.
Add your answer