Filter interviews by
Print the nodes at the boundaries of a binary tree (leaf nodes + top view).
Traverse the tree in pre-order and keep track of the level of each node
Add the leftmost and rightmost nodes of each level to the result
For top view, traverse the tree in level-order and add the first node of each level to the result
Find minimum bombs to clear matrix by cascading impact to adjacent cells with value 1 greater than the bombed cell.
Create a 2D matrix of integers
Iterate through each cell and drop a bomb, then check its adjacent cells
If an adjacent cell has value 1 greater than the bombed cell, drop a bomb on that cell as well
Repeat until no more cells can be bombed
Count the number of bombs dropped to clear the matrix
Dependency Injection & IOC in Spring
Dependency Injection is a design pattern that allows objects to be loosely coupled and easily testable
In Spring, IOC (Inversion of Control) is used to manage dependencies and inject them into objects at runtime
IOC container in Spring is responsible for creating and managing objects and their dependencies
Spring supports different types of dependency injection such as constructor injec
Linkedlist , graph and tree
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
Gainsight interview questions for 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 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
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
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
Top trending discussions
Data structure was more and it was difficult round
I applied via Campus Placement and was interviewed in Nov 2024. There were 3 interview rounds.
JUST BASIC CODING WITH MCQ AND MEETLE PLATFORM
Some of the top questions asked at the Gainsight Software Engineer interview -
based on 6 interviews
1 Interview rounds
based on 12 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