Filter interviews by
Puzzle solving, maths.
I applied via campus placement at Indian Institute of Information Technology (IIIT), Guwahati and was interviewed before Sep 2023. There were 4 interview rounds.
Questions on data structure and algorithm
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them back together in sorted order.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
I applied via Recruitment Consulltant and was interviewed before Aug 2023. There were 5 interview rounds.
Implement a stack using arrays with push, pop, and peek operations.
Create an array to store the elements of the stack
Implement push operation by adding elements to the end of the array
Implement pop operation by removing the last element from the array
Implement peek operation by returning the last element of the array without removing it
I applied via Approached by Company and was interviewed before Dec 2022. There were 7 interview rounds.
Medium to hard questions were asked
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
Gainsight interview questions for popular designations
I applied via Approached by Company and was interviewed before Dec 2022. There were 7 interview rounds.
Medium to hard questions were asked
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
Get interview-ready with Top Gainsight Interview Questions
I was interviewed in Dec 2021.
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)
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...
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...
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
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...
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...
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...
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
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...
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.
Tip 1 : have good hands on data structure and algorithms and competitive programming
Tip 2 : strong knowledge of core subjects of dbms, os and oops ( know less topic but in depth)
Tip 3 : your resume should speak about your skills and personality
Tip 1 : Know your resume - you are what you write in your resume
Tip 2 : should definately contain - Details, Education, Experience, Skills
Tip 3 : Additional Section - awards, certifications, publications, patents, volunteer work, extra curricular activities, hobbies
Tip 4 : Have a habit of tuning your resume according to the job profile
Tip 5 : Platform - flowcv.io
I applied via Job Portal and was interviewed before Apr 2023. There were 2 interview rounds.
Linked list detect circular ll startpoint, delete nth node of ll
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
Coding on Data structures
I applied via LinkedIn and was interviewed in Oct 2021. There were 6 interview rounds.
Basic coding questions.
Cognitive aptitude test
Top trending discussions
Some of the top questions asked at the Gainsight interview -
based on 26 interviews
Interview experience
based on 104 reviews
Rating in categories
Software Engineer
107
salaries
| ₹10 L/yr - ₹22 L/yr |
Senior Software Engineer
81
salaries
| ₹13.5 L/yr - ₹25.5 L/yr |
Associate Software Engineer
43
salaries
| ₹8.5 L/yr - ₹16 L/yr |
Lead Software Engineer
25
salaries
| ₹24 L/yr - ₹40.5 L/yr |
Senior Solution Engineer
24
salaries
| ₹14 L/yr - ₹20.5 L/yr |
Freshworks
Zoho
Chargebee
MindTickle