Genpact SDE-2 Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Medium

Q1. 
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constr...read more
Ans. 
Recursively remove consecutive duplicate characters from a string.
• Use recursion to check if the current character is the same as the next character, if so, skip the next character

• Base case: if the string is empty or has only one character, return the string

• Recursive case: if the current character is the same as the next character, call the function recursively with the string excluding the next character
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Q1. 
Reverse String Operations Problem Statement
You are provided with a string S and an array of integers A of size M. Your task is to perform M operations on the string as specified by the indices in array A...read more
Ans. 
Perform a series of reverse string operations on a given string based on specified indices.
• Iterate through the array of indices and reverse the substring of the string based on the given indices.

• Ensure to reverse the substring from the starting index to len(S) - starting index - 1.

• Continue the operations in the sequence specified by the array of indices to get the final string.
Answered by AI
View 1 more answer

Round duration - 50 minutes
Round difficulty - Medium

Round duration - 360 minutes
Round difficulty - Hard

Timing- Any 6 hours of my choice in the 24 hour window. (10:00 p.m. to 4:00 a.m. I selected)
Environment was very friendly and easy to use.
No significant activity.
This was the only coding round.

Q1. 
Prime Time Again Problem Statement
You are given two integers DAY_HOURS and PARTS. The integer 'DAY_HOURS' represents the number of hours in a day, and the day can be divided into 'PARTS' equal parts. You...read more
Ans. 
Find total instances of equivalent prime groups in a day divided into equal parts.
• Iterate through each part of the day and check for prime pairs in different parts

• Use a helper function to check if a number is prime

• Ensure the day is evenly divided by parts and each prime group has hours from different parts
Answered by AI
Add your answer

Round duration - 10-15 minutes
Round difficulty - Easy

Timing- 12:15 p.m. 
Environment was very good .
Not any significant activity.
The interviewer was very friendly and talked like friends.

Round duration - 20 minutes
Round difficulty - Medium

Timing- 12:30 p.m. to 12:45 p.m
Environment was very comfortable.
No other significant activity.
Interviewer was very good and talking very politely & friendly.

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning about 10:00AM-10:40AM. The platform used for this round was hackerrank. There are 15 MCQ's which cover portions of Aptitude, Data Structures, DBMS, SQL

Q1. 
Minimum Operations Problem Statement
You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...read more
Ans. 
Minimum number of operations to make all elements in the array equal by performing addition, subtraction, multiplication, or division.
• Iterate through the array to find the maximum and minimum values.

• Calculate the difference between the maximum and minimum values.

• The minimum number of operations needed is the difference between the maximum and minimum values.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 7:00PM-7:20PM. Platform used for this round was skype. Interviewer was very serious while taking my interview.