Gainsight Interview Questions and Answers

Medium to hard questions were asked

Q1. Buy stock sell problem
Ans. 
The Buy stock sell problem involves finding the maximum profit that can be obtained by buying and selling stocks.
• Iterate through the array of stock prices

• Keep track of the minimum price seen so far

• Calculate the profit by subtracting the minimum price from the current price

• Update the maximum profit if the calculated profit is greater

• Return the maximum profit
Answered by AI
Add your answer

Q1. 2 Hard DSA questions and Project related questions
Add your answer

Q1. Parking lot LLD
Add your answer

Q1. Basic spring boot project with test cases. Looked for clean code, design pattern usage, optimal usage of data types &data structures and edge cases covering in test cases.
Add your answer

Q1. Salary discussions and negotiations
Add your answer

Medium to hard questions were asked

Q1. Buy stock sell problem
Ans. 
The buy stock sell problem involves finding the maximum profit that can be made by buying and selling a stock at different prices.
• Calculate the difference between each pair of prices in the array

• Find the maximum subarray sum to get the maximum profit

• Consider edge cases like when prices are decreasing or all prices are the same
Answered by AI
Add your answer

Q1. 2 Hard DSA questions and Project related questions
Add your answer

Q1. Parking lot LLD
Add your answer

Q1. Basic spring boot project with test cases. Looked for clean code, design pattern usage, optimal usage of data types &data structures and edge cases covering in test cases.
Add your answer

Q1. Salary discussions and negotiations
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

Linked list detect circular ll startpoint, delete nth node of ll

Q1. Hashmap and basic tree problems
Add your answer

Q1. Javascript basics like closures,hoisting,2 small dsa qs,promises,event loop,positions in css,box model and many stuff so prepare for javascript basics and also html css.
Add your answer

Q1. It was about angular so asked me for derivates,rxjs,observables,some bit of redux coz I cam from react background
Add your answer

Coding on Data structures

Q1. String coding qns
Add your answer