CoLeague Solutions Software Developer Intern Interview Questions and Answers

Round duration - 45 minutes
Round difficulty - Medium

The interview was with a Korean employee. 

Q1. 
Bridge in Graph Problem Statement
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...read more
Ans. 
Find all the bridges in an undirected graph.
• Use Tarjan's algorithm to find bridges in the graph.

• A bridge is an edge whose removal increases the number of connected components.

• Check for bridges by removing each edge and checking the number of connected components.

• Return the edges that are bridges in non-decreasing order.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Interviewer was an Indian employee. 

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
Identify the longest palindromic substring in a given string.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found

• Return the longest palindrome with the smallest start index
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Interviewer was an Indian employee.

Q1. 
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...read more
Ans. 
Given a sorted alien dictionary in an array of strings, determine the character order of the alien language.
• Iterate through the words in the dictionary to build a graph of character dependencies.

• Perform a topological sort on the graph to determine the character order.

• Return the character order as a list of characters.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Interviewer was an Indian employee. 

Q1. 
Problem: Ninja's Robot
The Ninja has a robot which navigates an infinite number line starting at position 0 with an initial speed of +1. The robot follows a set of instructions which includes ‘A’ (Acceler...read more
Ans. 
Determine the minimum length of instruction sequence for a robot to reach a given target on an infinite number line.
• Start at position 0 with speed +1, update position and speed based on 'A' and 'R' instructions

• For each test case, find the shortest sequence of instructions to reach the target

• Consider both positive and negative positions for the robot
Answered by AI
Add your answer

Q1. Basic OOPs and Database
Add your answer
Q2. BTech Subjects and Upcoming IT Trends
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing: Between 3-5 pm we could take the test anytime
The test environment was hackerrank. Great user interface and I did not suffer anyt problems.
There was no interviewer as it was coding test. 
There were 2 coding questions asked.

Q1. 
Subset OR Problem Statement
You are given an array/list ARR of N positive integers. Your task is to determine the size of the smallest subset that achieves the maximum possible OR value among all subsets.
...read more
Ans. 
Find the size of the smallest subset with maximum OR value among all subsets of an array of positive integers.
• Iterate through all possible subsets of the array

• Calculate the OR value for each subset

• Track the size of the smallest subset with maximum OR value
Answered by AI
Add your answer
Q2. 
Wildcard Queries Problem Statement
Given a dictionary D with N words, each of a fixed length L and consisting only of lowercase English alphabets, answer Q queries. Each query consists of a word W of the ...read more
Ans. 
Given a dictionary and queries with wildcard characters, determine how many words in the dictionary can match each query.
• Iterate through each query and dictionary word to check for matches

• Replace '?' with all possible lowercase letters and compare with dictionary words

• Count the number of matches for each query
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing was late at night ie 9:30 PM for this round.
The environment was nice. It was on Google meet.
The interviewer was very friendly and explained the question well

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze to reach its destination, given a matrix representation of the maze.
• Use backtracking to explore all possible paths from the starting position to the destination.

• Keep track of the current path and explore all possible directions at each step.

• Terminate the exploration when reaching the destination and add the path to the result list.

• Sort the result list of paths in alphabetical...read more
Answered by AI
Add your answer
Q2. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal of an undirected and disconnected graph starting from vertex 0.
• Implement BFS algorithm to traverse the graph starting from vertex 0.

• Use a queue to keep track of visited nodes and their neighbors.

• Ensure to print the nodes in numerical sort order when multiple neighbors are present.

• Handle disconnected components by checking for unvisited nodes.

• Output the BFS traversal sequence for each test case in a separa...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was a hangout video call. The interviewer asked me these questions. Tell me about yourself and 1 coding question.

Q1. 
Special Numbers Problem Statement
Your task is to find the total count of special numbers within a range from 1 to a given integer, 'MAXVAL'. A special number is defined as a number whose digits, when rot...read more
Ans. 
Count the total number of special numbers within a given range by rotating digits 180 degrees.
• Create a function to check if a number is a special number by rotating its digits.

• Iterate through the range from 1 to MAXVAL and count the special numbers.

• Handle the digit rotation mapping for 0, 1, 6, 8, 9.

• Return the count of special numbers for each test case.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was an On-site (Behavioural Round) interview. He asked me these questions.

Round duration - 60 Minutes
Round difficulty - Easy

This was another On-site ( DS & Algo) algorithm.

Q1. 
Covid Vaccination Distribution Problem
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...read more
Ans. 
Given constraints, find max vaccines administered on a specific day during a vaccination drive.
• Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.

• Distribute vaccines evenly across days while maximizing the number on the specified day.

• Ensure that the sum of vaccines administered does not exceed the maximum allowed.

• Consider edge cases like when the number of days ...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Another On-site ( DS & Algo) interview.

Q1. 
Painter's Partition Problem Statement
Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required...read more
Ans. 
Determine the minimum time required to paint all boards with given constraints.
• Use binary search to find the minimum and maximum possible time to paint all boards.

• Iterate through the boards and assign them to painters based on the time constraints.

• Calculate the total time taken to paint all boards with the assigned painters.
Answered by AI
View 1 more answer
Q2. 
Chocolate Distribution Problem
You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...read more
Ans. 
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
• Sort the array of chocolates.

• Use sliding window technique to find the minimum difference between the largest and smallest number of chocolates.

• Return the minimum difference as the output.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Another On-site ( DS & Algo) interview.

Q1. 
Problem Statement: Minimize the Maximum
You are given an array of integers and an integer K. For each array element, you can adjust it by increasing or decreasing it by a value of K. Your goal is to minim...read more
Ans. 
Given an array of integers and an integer K, minimize the difference between the maximum and minimum elements after adjusting each element by +/- K.
• Sort the array in non-decreasing order.

• For each element, calculate the difference between the current element and the next element.

• Adjust the element by adding or subtracting K to minimize the difference.

• Return the minimum possible difference between the maximum and minimum...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

On-site ( DS & Algo) interview.
Google mainly focuses on logic and how you are coming with a solution. It notes down each and every small mistake. Interviewers are really very helpful. They expect clear code with an optimal approach.

Q1. 
Farthest Distance From Lands Problem Statement
Given a binary square matrix 'ARR' with 'N' rows and 'N' columns, where '0' represents water and '1' represents land.
Determine the water cell whose distanc...read more
Ans. 
Find the water cell farthest from land in a binary matrix using Manhattan distance.
• Iterate through the matrix to find all land cells and water cells

• Calculate the Manhattan distance of each water cell to the nearest land cell

• Return the maximum distance found
Answered by AI
Add your answer