Gainsight Interview Questions, Process, and Tips for Freshers

It was a DS and Algo round.

Q1. Again medium to hard dsa with dbms concepts
Add your answer

Q1. HM round . Basic project question
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Time duration - 1.5 hour, (10 mins window to login for test)
No. of coding Question - 3 (2 medium, 1 hard)

Q1. 
Connecting Ropes with Minimum Cost
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...read more
Ans. 
The problem is to connect N ropes of different lengths into one rope with minimum cost.
• Sort the array of rope lengths in ascending order.

• Initialize a variable to keep track of the total cost.

• While there are more than one rope remaining, take the two shortest ropes and connect them.

• Add the cost of connecting the two ropes to the total cost.

• Replace the two shortest ropes with the connected rope.

• Repeat the above steps unt...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Major Focus - Data structure, Algorithms, Competitive Programming 
Point To Remember - All questions in this round were asked to explain, implement, explain and tell time and space complexity, optimise if possible
No. of candidates shortlisted - 26

Q1. 
Bipartite Graph Problem Statement
Determine if a given graph is bipartite. A graph is bipartite if its vertices can be divided into two independent sets, 'U' and 'V', such that every edge ('u', 'v') conne...read more
Ans. 
The function checks whether a given graph is bipartite or not.
• A bipartite graph can be divided into two independent sets such that every edge connects a vertex from one set to the other.

• We can use graph coloring algorithm to check if the graph is bipartite.

• Start by coloring the first vertex with one color and all its neighbors with the other color.

• Continue coloring the remaining vertices, making sure that no adjacent v...read more
Answered by AI
Add your answer
Q2. 
Ninja and Substrings Problem Statement
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...read more
Ans. 
The task is to find all the different possible substrings of size two that appear in a given string as contiguous substrings.
• Iterate through the string and extract substrings of size two

• Store the substrings in an array

• Return the array of substrings
Answered by AI
Add your answer
Q3. 
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. 
The question asks to print the DFS traversal of an undirected and disconnected graph.
• Implement a Depth First Search (DFS) algorithm to traverse the graph.

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

• For each unvisited vertex, start a DFS traversal and print the connected component.

• Sort the vertices of each connected component in ascending order before printing.
Answered by AI
Add your answer