Gainsight interview experience Real time questions & tips from candidates to crack your interview

Associate Software Engineer

Gainsight
upvote
share-icon
6 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 Months
Topics: data structures, C++, oops, dbms, operating system
Tip
Tip

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 process
Where: Other
Eligibility: Above 7.5 CGPA
Resume Tip
Resume tip

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

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date14 Sep 2021
Coding problem1

Time duration - 1.5 hour, (10 mins window to login for test)
No. of coding Question - 3 (2 medium, 1 hard)

1. Connect N Ropes With Minimum Cost

Easy
20m average time
80% success
0/40
Asked in companies
ArcesiumUberOptum

You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connect the ropes with minimum cost.

The test-data is such that the result will fit into a 32-bit integer.

Try solving now
02
Round
Medium
Online Coding Interview
Duration20 Minutes
Interview date15 Sep 2021
Coding problem0

It consisted of two parts -:
1) Cognitive Aptitude Assessment - 40 Questions -> 20 mins
2) Behavioural Assessment - No time limit (approx 10-15 mins)
No of candidates shortlisted - 51

03
Round
Medium
Video Call
Duration90 minutes
Interview date15 Sep 2021
Coding problem3

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

1. DFS Traversal

Moderate
35m average time
65% success
0/80
Asked in companies
SamsungIntuitGoldman Sachs

Given an undirected and disconnected graph G(V, E), containing 'V' vertices and 'E' edges, the information about edges is given using 'GRAPH' matrix, where i-th edge is between GRAPH[i][0] and GRAPH[i][1]. print its DFS traversal.

V is the number of vertices present in graph G and vertices are numbered from 0 to V-1. 

E is the number of edges present in graph G.
Note :
The Graph may not be connected i.e there may exist multiple components in a graph.
Try solving now

2. Ninja and substrings

Easy
20m average time
80% success
0/40
Asked in companies
LinkedInLivekeeping (An IndiaMART Company)Zoho Corporation

Ninja has been given a string 'STR' containing only lowercase alphabetic characters. Ninja has to find the number of all the different possible substrings of size two that appear in 'STR' as contiguous substrings.

For example:

If the string is “abcd”, then all possible substrings of size two are { “ab”, “bc”, “cd”}.
Try solving now

3. Bipartite Graph

Moderate
50m average time
50% success
0/80
Asked in companies
UberWalmarteBay

Given a graph, check whether the graph is bipartite or not. Your function should return true if the given graph's vertices can be divided into two independent sets, ‘U’ and ‘V’ such that every edge (‘u’, ‘v’) either connects a vertex from ‘U’ to ‘V’ or a vertex from ‘V’ to ‘U’.

You are given a 2D array ‘edges’ which contains 0 and 1, where ‘edges[i][j]’ = 1 denotes a bi-directional edge from ‘i’ to ‘j’.

Note:
If edges[i][j] = 1, that implies there is a bi-directional edge between ‘i’ and ‘j’, that means there exists both edges from ‘i’ to ‘j’ and to ‘j’ to ‘i’.

For example

Given:
‘N’ = 3
‘edges’ = [[0, 1, 1], [0, 0, 1], [0,0,0]]. 

Try solving now
04
Round
Hard
Video Call
Duration100 Minutes
Interview date15 Sep 2021
Coding problem0

Major Focus - Competitive Programming, Object Oriented Programming, Operating system, problem solving with DBMS, Mental and logical ability 
Q1 - Four Pillars of OOPs, explain virtual inheritance with e.g, 
Q2 - Pure virtual Function and abstract class with example and Implementation 
Q3 - Implement example to show difference between runtime and compile time polymorphism
Q4 - Design, structure and tell approach + DBMS + SQL query on Online Shopping Mart (25-30 mins)
Q5 - Basics And Concepts of Memory Management Unit, Paging,Indexing, locking system, deadlock all 
concepts, Concurrency Control
Q6 - Puzzle - (5 Pirates and 100 Gold Coins)
Q7 - Given a point P and other N points in two dimensional space, find K points out of the N points which 
are nearest to P.
Note - detailed discussion and explanation of every question, Implement and Explain from brute force to optimised approach using heap, explain time and space complexity
No. of candidates shortlisted - 16

05
Round
Medium
Video Call
Duration70 Minutes
Interview date16 Dec 2021
Coding problem0

Major Focus - Project + OOPS + Attitude + Aptitude + Personality
Q1 - detailed questions on mentioned project on resume (25-30 mins)
1) Business Requirement
2) detailed explanation of the project highlighting your contribution in 
the project
3) future scope with advantages
4) drawbacks and improvement possible
Q2 - problems on aptitude and oops concepts like inheritance and its types with public, private and 
protected mode, diamond problem in c++ (example + implementation)
Q3 - personality check
1) what would you do in situation if you are a team leader and their is any dispute between your 
team members
2) how would you react if any dissatisfied client confronted you
3) your short term and long term goal
4) why you choose btech in computer science and c++, DSA and CP as skill set
No. of candidates shortlisted - 10

06
Round
Easy
HR Round
Duration25 Minutes
Interview date27 Dec 2021
Coding problem0

Major Focus - Personality check, Overall Behaviour , resume based
Q1 - What is your strength and weakness
Q2 - who was favourite professor in your college and why
Q3 - what do you most like about your college
Q4 - Why you don’t pursued your family business or your elder brothers profession as carrier 
Q5 - Why you want to join, what do you know about Gainsight
Q6 - Some Questions regarding your internships, co-curricular activities like tell me about the poem you 
wrote, why and what do you learnt from joining samvaad club(the dramatic society), what was your work and role in 
internship and how did it help you 
Q7 - How do you take your failures and success in your life
Q8 - Question on resume writing skill and appreciation for resume.
No of candidates shortlisted - 10

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Software Engineer
2 rounds | 5 problems
Interviewed by Gainsight
1046 views
0 comments
0 upvotes
SDE - 1
3 rounds | 8 problems
Interviewed by Gainsight
836 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Gainsight
711 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
2370 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
2671 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
2347 views
0 comments
0 upvotes