Upload Button Icon Add office photos

Gainsight

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Gainsight Associate Software Engineer Interview Questions, Process, and Tips

Updated 25 Sep 2024

Top Gainsight Associate Software Engineer Interview Questions and Answers

  • 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 ro ...read more
  • 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 lowerc ...read more
  • Q3. 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', su ...read more

Gainsight Associate Software Engineer Interview Experiences

2 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
-
Round 1 - Coding Test 

It was a DS and Algo round.

Round 2 - Technical 

(1 Question)

  • Q1. Again medium to hard dsa with dbms concepts
Round 3 - HR 

(1 Question)

  • Q1. HM round . Basic project question

I was interviewed in Dec 2021.

Round 1 - Coding Test 

(1 Question)

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...

  • 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...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

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...

  • 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...

  • Answered by AI
  • 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...

  • 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
  • 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...

  • 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

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from ABES Engineering College. Eligibility criteriaAbove 7.5 CGPAGainsight interview preparation:Topics to prepare for the interview - data structures, C++, oops, dbms, operating systemTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

Associate Software Engineer Interview Questions Asked at Other Companies

asked in Accenture
Q1. Triplets with Given Sum Problem Given an array or list ARR consis ... read more
asked in Gainsight
Q2. Connecting Ropes with Minimum Cost You are given 'N' ropes, each ... read more
Q3. Intersection of Two Arrays II Given two integer arrays ARR1 and A ... read more
asked in Clarivate
Q4. Best Time to Buy and Sell Stock II Problem Statement Given the st ... read more
Q5. Ninja and Alternating Largest Problem Statement Ninja is given a ... read more

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Hard
Process Duration
-
Result
Not Selected
Round 1 - Aptitude Test 

There are 2 sections one is Output guess and Another one is Quantitative

Round 2 - Coding Test 

I didn't attend 2nd round..i was eliminated in 1st round

Interview Preparation Tips

Interview preparation tips for other job seekers - Study hard
Round 1 - Aptitude Test 

20 questions of aptitude

Round 2 - Coding Test 

Hard

Round 3 - Coding Test 

Very hard

Round 4 - HR 

(6 Questions)

  • Q1. Share details of your previous job.
  • Q2. Why should we hire you?
  • Q3. Where do you see yourself in 5 years?
  • Q4. What is your family background?
  • Q5. What are your strengths and weaknesses?
  • Q6. Tell me about yourself.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well. Easy to crack. Coading should be practiced

I applied via Campus Placement

Interview Questionnaire 

3 Questions

  • Q1. Tell me one thing about you that's not listed on your resume
  • Ans. 

    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

  • Answered by AI
  • Q2. When you hear InMobi, what's the first word that comes in your head?
  • Ans. 

    Mobile advertising platform

    • Adtech

    • Mobile marketing

    • App monetization

  • Answered by AI
  • Q3. The office of InMobi technologies has 10 floors, each with 300 employees. In the morning (7-8 AM), the building sees 3000 employees entering and waiting in a queue for 3 lifts. In the morning, everyone goe...

Interview Preparation Tips

Round: Resume Shortlist
Experience: The first round was a resume shortlist, which I think was on the basis of programming and coding courses (and projects) taken along with your CGPA. Out of 10 shortlisted people, I knew 4 and all of us were 9 pointers. The rest who I didn't know turned out to be 9 pointers as well! :P
Out of 10 shortlisted people, 3 (including me) were from ECE and the rest were from CS. Even though InMobi was open for Mathematics & Computing, no person from MnC dept. was in the shortlist. (Presumably due to their CGPAs or some other criterion that I'm not in the knowledge of.)
Tips: i) High CGPA is a must (We're talking above 9, at the end of 2nd year for CS/ECE and 3rd year for MnC)
ii)Taking programming and algorithm courses and projects is important, as that must be visible in your resume.

Round: Puzzle Interview
Experience: One special thing about the interviews, you're asked not to wear any formals! That actually helps in taking the tension off of things!
It's simple logic, after that. Increase the lift's speed (taking in mind of the safety), collecting usage data, optimising the lift's floor-stoppage according to that.
As told after the interview, the interviewer is just observing how you think and approach a problem.

One odd thing was not being asked about any coding/algorithm questions even though the profile was for a software engineer.

After this question, I was asked if I had any questions to ask. I simply stated that the work environment and culture affected me as much as the profile I'm applying for. Thus, the drive and motivation of the people who work there is also very important. So I asked what are the companies' values which the employees believe in, too.
Tips: Stay confident, don't let any tension get to your head.
In the future, InMobi may start asking coding questions too in the interviews. or change the selection procedure, which will be communicated in the PPT of InMobi.
Whatever may happen, the first round should show your zeal to solve problems, your creativity in trying different approaches, and applying logic to find the best solution.

Round: HR Interview
Experience: OK! There were a lot of questions asked since the interview was more like a conversation taking place. Like in ANY conversation, keep proper eye contact, smile and be approachable for any questions. Show enthusiasm in your voice and your answers. The interviewer asked me questions about
i)My resume, and all the activities that I'd listed there. (eg: Why did you enlist in this course? Do you like coding?)
ii)Why programming, how does it interest you?
iii)Basic questions about InMobi, like 'What do you know about us after attending the PPT?' and 'Why InMobi'

Since I had done quite a lot of marketing activities, I was also asked about that. Will you do an MBA in the future? What all did you do for marketing? I had a strong background in digital marketing, and we had a little chat about mobile marketing and what's the future of mobile advertising.
Tips: Smile, for god's sake! It's a conversation about you, do all the basic things to improve the conversational experience.
Small things like greeting the interviewer, smiling, proper eye contact, and speaking properly are paramount.

Like in any HR interview, make sure you know yourself and your resume properly, so that you don't phase out in the interview when asked some 'unexpected' question. (since that's when they know thatyou might be lying/exaggerating). Hence introspect enough before sitting the interviews.

General Tips: Make sure you're able to convince yourself and the interviewers for why do you want to work in Inmobi Technolgies.

I've already shared the rest in previous sections! :)

2 people out of 10 were selected for this internship experience, so make sure you prepare well! All the best! :D

Skill Tips: I don't think that this adds on as a skill, but InMobi wants to create a huge impact on the mobile world and the mobile advertising sector.
Your knowledge about this sector in general could help you strike good conversations (at least in the HR round).
Skills: Logic, Problem Solving Abilties, Creativity, Communication Skills
Duration: 2.5
College Name: IIT Kharagpur
Motivation: I'm a gadget geek from my childhood. The mobile industry amazes me as it's been the biggest change-bringer in the modern world. InMobi as a company wants to create a huge impact in the mobile advertising space and mobile advertising! And seeing their products that they offer in this domain had me thinking that they're doing something unique and awesome!
The work culture of InMobi is just amazing, right from flexible work hours to the epic office they have in Bangalore full of awesome people working towards that one goal! Also, InMobi offers their employees opportunities to shift between various verticals if they want to. All of this (along with a good compensation ;-) ) was enough motivation for me to apply!
Funny Moments: When I was asked whether I was in the third year, I said yes, and then said, usually people think that I'm still in high school!
We had a good laugh on that one! :P

Otherwise also, the entire procedure was relaxed and fun in general.

Interview Questionnaire 

9 Questions

  • Q1. Find Maximum sub sequence sum in an array ?
  • Ans. 

    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

  • Answered by AI
  • Q2. What do you understand by the endianness of the system ? How do you find out the the type of endianness ?
  • Ans. 

    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...

  • Answered by AI
  • Q3. Sort an array which consists of 0's and 1's only
  • Ans. 

    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.

  • Answered by AI
  • Q4. A question on applications of minimum spanning tree, apply prim's or kruskal's algorithm
  • Q5. What do you understand by Heaps, max and min heaps ?
  • Ans. 

    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

  • Answered by AI
  • Q6. What do you understand by hashing ? questions on application of hashing
  • Q7. Find 3 nos a,b and c in an array where a+b = c
  • Ans. 

    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.

  • Answered by AI
  • Q8. Some puzzles, as the other interviewee said, but not asked to me
  • Q9. Questions on Dynamic programming

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Algorithms on arrays and strings (coding)
  • Ans. 

    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

  • Answered by AI
  • Q2. Distributed Database Design
  • Q3. Large scale Ad Server Design
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Round: Interview
Experience: They tested on thought-process during design problems. What problems are with the current solution I suggested and how to improve it...
Tips: Hints from interviewer are very helpful
Keep talking while you are thinking

Skills: Algorithms, Thinking Skills, Coding
College Name: IIT KHARAGPUR

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 Medium level DSA question

Round 2 - Technical 

(2 Questions)

  • Q1. Mirror binary tree
  • Q2. Optimally find n^m
  • Ans. 

    Use the exponentiation by squaring algorithm to optimally find n^m.

    • Use the exponentiation by squaring algorithm to reduce the number of multiplications needed.

    • Divide the exponent by 2 and recursively calculate the result.

    • Handle the cases when the exponent is even or odd separately.

    • Example: n^5 = n * n^2 * n^2

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Edit distance problem
  • Ans. 

    The edit distance problem involves finding the minimum number of operations required to transform one string into another.

    • The edit distance problem can be solved using dynamic programming.

    • Common operations include insertion, deletion, and substitution of characters.

    • Example: Given strings 'kitten' and 'sitting', the edit distance is 3 (substitute 'k' with 's', insert 'g', substitute 'n' with 'g').

  • Answered by AI
  • Q2. Light switch puzzle

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Sep 2022. There were 3 interview rounds.

Round 1 - Coding Test 

2 coding , 2 SQL with some quants

Round 2 - Technical 

(1 Question)

  • Q1. Remove redundant parentheses in a expression
  • Ans. 

    Remove redundant parentheses in a expression

    • Identify the innermost parentheses

    • Evaluate the expression inside the innermost parentheses

    • Replace the innermost parentheses with the evaluated expression

    • Repeat until no more redundant parentheses exist

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Why do you want to join Chargebee?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and focus on your strength and if you screw up a part don’t feel bad

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Gainsight Interview FAQs

How many rounds are there in Gainsight Associate Software Engineer interview?
Gainsight interview process usually has 3 rounds. The most common rounds in the Gainsight interview process are Coding Test, Technical and HR.
How to prepare for Gainsight Associate Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Gainsight. The most common topics and skills that interviewers at Gainsight expect are Data Structures, Design Patterns, ETL, Java and Javascript.

Recently Viewed

INTERVIEWS

Intellect Design Arena

No Interviews

INTERVIEWS

RNTBCIL

No Interviews

SALARIES

Comcast India Engineering Center

INTERVIEWS

Ppap Automotive

No Interviews

INTERVIEWS

Publicis Sapient

No Interviews

INTERVIEWS

Mu Sigma

No Interviews

LIST OF COMPANIES

Comcast India Engineering Center

Overview

INTERVIEWS

Mu Sigma

No Interviews

INTERVIEWS

Mu Sigma

No Interviews

INTERVIEWS

Tandem Crystals

No Interviews

Tell us how to improve this page.

Gainsight Associate Software Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Gainsight Associate Software Engineer Salary
based on 43 salaries
₹8.5 L/yr - ₹16 L/yr
117% more than the average Associate Software Engineer Salary in India
View more details

Gainsight Associate Software Engineer Reviews and Ratings

based on 5 reviews

3.2/5

Rating in categories

2.5

Skill development

3.8

Work-life balance

3.3

Salary

2.5

Job security

3.3

Company culture

2.3

Promotions

2.6

Work satisfaction

Explore 5 Reviews and Ratings
Software Engineer
106 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
81 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
43 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Lead Software Engineer
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Solution Engineer
24 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Gainsight with

Freshworks

3.5
Compare

Zoho

4.3
Compare

Chargebee

3.9
Compare

MindTickle

2.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview