Genpact private limited interview experience Real time questions & tips from candidates to crack your interview

SDE - 2

Genpact private limited

2 rounds | 6 Coding problems

Vantary Revanthkumar

Fresher | Oct 2019

Selected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures and Algorithms, Operating systems, DBMS, Computer Networks, OOPS

Tip

Tip 1 : Don't get frustrated if not selected, keep believing yourself.
Tip 2 : Prepare data structures and algorithms well. Practice coding daily. OOPS in any programming language will do. Prefer quality of codes to quantity.
Tip 3 : If possible do a project on full stack development.

Application process

Where: Campus

Eligibility: Above 7cgpa

Resume tip

Tip 1 : Keep it simple and try to adjust everything in one page. As a fresher it is better if you can have 2 projects in your cv.
Tip 2 : Don't add unnecessary details such as parents details.

Interview rounds

Round

Easy

Online Coding Interview

Duration60 minutes

Interview date26 Oct 2019

Coding problem2

It is online round and it was conducted around 11 AM on campus. Difficulty was medium. 2 coding questions were asked. One question is based on arrays(easy) and the other question is based on usage of oops concepts like Inheritance, polymorphism. Everything went smooth.

1. Subarray With Given Sum

Moderate

15m average time

85% success

0/80

Asked in companies

Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.

Note:

If two or more such subarrays exist, return any subarray.

For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].

Problem approach

I started with brute force method but test cases were failed due to time complexity. Use a similar approach to a sliding window. Start with an empty subarray, add elements to the subarray until the sum is less than x. If the sum is greater than x, remove elements from the start of the current subarray

Try solving now

2. OOPS Question

Only java was allowed. Parent class was given and asked to write code for child classes and function overloading.

Problem approach

Be clear with oops concepts. If oops concepts are clear then the question can be solved easily.

Round

Medium

Video Call

Duration50 minutes

Interview date28 Oct 2019

Coding problem4

Round started with self introduction and discussion of project. Everything went fine.
Note: we didn't have hr round due to time constraint. You can expect hr round.

1. Find Duplicate

Easy

0/40

Asked in companies

You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ranging from 0 to 3 and among these, there is a single integer value that is present twice. You need to find and return that duplicate number present in the array.

Note :

Duplicate number is always present in the given array/list.

Problem approach

Step 1: create an array of fixed size 256 as 256 ascii characters are available. Initialise all the elements of array with 0.
Step 2: iterate over array and store the frequency of every character.
Step 3: Iterate over the array and print the characters with frequency more than 1.
Note: problem can be solved using maps too.

Try solving now

2. DBMS Questions

Explain the concept of normalisation and types.

Problem approach

Tip 1 : Explain everything clearly.
Tip 2 : Don't use the words that you are not confident about. Interviewer might ask questions based on your answers.