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

SDE - Intern

Gemini Solutions
upvote
share-icon
4 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: DSA, DBMS, Java, Python, Javascript, MongoDB, Nodejs, SQL, PL/SQL, Quantitative Aptitude, Linux
Tip
Tip

Tip 1 : Be familiar with linux and its commands
Tip 2 : Prepare for output based questions in C
Tip 3 : Quantitative questions similar to those in CAT will be helpful for the first round

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Mention projects, internships, certifications
Tip 2 : You can also mention your ranking on competitive programming platforms like codechef, hackerrank etc.

Interview rounds

01
Round
Hard
Online Coding Interview
Duration60 Minutes
Interview date8 Apr 2019
Coding problem0

It was in the morning and environment was new because the test portal was new. It had MCQ as well as non MCQ questions

02
Round
Medium
Face to Face
Duration45 Minutes
Interview date15 Apr 2019
Coding problem5

My interview was scheduled in the morning but got very late and it actually started around 2 pm. Things could have been planned better. There were many candidates with interview on that day. The interviews were getting delayed as the interviewers were busy or not available. HR could have managed it better. Some interviewers sent interns on their behalf to take interview.

1. Merge Sort

Easy
15m average time
85% success
0/40
Asked in companies
Media.netHewlett Packard EnterpriseIBM

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

subsequence

The above illustrates shows how merge sort works.
Note :
It is compulsory to use the ‘Merge Sort’ algorithm.
Problem approach

The questions were pretty much straightforward and text book questions.

Try solving now

2. DBMS Questions

Questions on mongoDB like structure of _id, sql vs no sql, use cases for document oriented databases, what are aggregation pipelines, few queries

Problem approach

The interviewer asked specifically from MongoDB because I had mentioned mongoDB certification in my resume.

3. OOPS Based Questions

Explain the OOPS principles with example.
What are interfaces? 
How are interfaces different from abstract classes?
Types of inheritance?

4. Quick Sort

Moderate
10m average time
90% success
0/80
Asked in companies
FreshworksSamsung R&D InstituteLenskart

You are given an array of integers. You need to sort the array in ascending order using quick sort.

Quick sort is a divide and conquer algorithm in which we choose a pivot point and partition the array into two parts i.e, left and right. The left part contains the numbers smaller than the pivot element and the right part contains the numbers larger than the pivot element. Then we recursively sort the left and right parts of the array.

Example:

Let the array = [ 4, 2, 1, 5, 3 ]
Let pivot to be the rightmost number.

example

After the 1st level partitioning the array will be { 2, 1, 3, 4, 5 } as 3 was the pivot. After 2nd level partitioning the array will be { 1, 2, 3, 4, 5 } as 1 was the pivot for the left part and 5 was the pivot for the right part. Now our array is sorted and there is no need to divide it again.

Try solving now

5. Detect and Remove Loop

Moderate
10m average time
90% success
0/80
Asked in companies
AmazonMicrosoftFreshworks

Given a singly linked list, you have to detect the loop and remove the loop from the linked list, if present. You have to make changes in the given linked list itself and return the updated linked list.

Expected Complexity: Try doing it in O(n) time complexity and O(1) space complexity. Here, n is the number of nodes in the linked list.

Try solving now
03
Round
Medium
Face to Face
Duration30 Minutes
Interview date15 Apr 2019
Coding problem1

Second round was held on the same day around 5 pm in the office.

1. Javascript based technical Questions

What is Nodejs?
NodeJS vs Express?
Why did you use koa in your project instead of express?
Create an http and an https server in pure nodejs i.e. without using any framework?
What are generators in javascript?
What is asynchronous programming?
What is callback hell?

Problem approach

If possible try to take your projects live on cloud services like heroku etc as it can give you brownie points because the interviewer can actually see it in action.

04
Round
Hard
Face to Face
Duration20 Minutes
Interview date15 Apr 2019
Coding problem1

This final round was with a project manager and it was scheduled very late approx 7:30 pm. The interviewer was a senior person and was very arrogant during the interview. The interviewer asked questions from anywhere and everywhere. 

1. Basic Hr Questions

Why you chose computer science? 

Asked me to solve a very tough mathematical puzzle with time limits.

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
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
3688 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
2650 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
2324 views
0 comments
0 upvotes