Filter interviews by
Clear (1)
Linkedlist , graph and tree
I applied via Campus Placement 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 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
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 in Feb 2022. There were 2 interview rounds.
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
Top trending discussions
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
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
106
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
81
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Solution Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
Chargebee
MindTickle