Capgemini

3.8

Capgemini is a global leader in consulting, digital transformation, technology, and engineering services. The Group is at the forefront of innovation to address the entire breadth of clients’ opportunities... read more Paris, France Engaged employer Filter interviews by
Designation

Select Designation

Clear

1.1k results found

### Interview Rounds

Coding Test

Face to Face

HR

I was interviewed in Oct, 2020.

### Interview Questions

• Q1. Anagram Pairs

#### Other examples include:

``````'triangle' and 'integral'
'listen' and 'silent'
``````

#### You would be given two strings. You have to tell whether these strings form an anagram pair or not. The strings form an anagram pair if the letters of one string can be rearranged to form another string.

##### Note:
``````Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct.
``````
##### Input format:
``````The first and the only line of input contains two single space-separated strings Str1 and Str2, respectively.
``````
##### Remember/Consider:
``````Neither of the two input strings contains spaces in between, except to differentiate one from the other.

Also, both the strings will be in lowercase characters.
``````
##### Output format:
``````The only line of output contains either True or False. True, if the given two strings form an anagram pair and False otherwise.

You don't have to explicitly print by yourself. It has already been taken care of.
``````
##### Constraints:
``````1 <= N <= 10^5
1 <= M <= 10^5
Where N and M are the lengths of the strings str1 and str2 , respectively.

Time Limit: 1sec
``````
• Q2. Next Greater Number

#### You are given a string S which represents a number. You have to find the smallest number strictly greater than the given number which contains the same set of digits as of the original number i.e the frequency of each digit from 0 to 9 should be exactly the same as in the original number.

##### For example:
``````If the given string is 56789, then the next greater number is 56798. Note that although 56790 is also greater than the given number it contains 1 '0' which is not in the original number and also it does not contain the digit '8'.
``````

#### Note:

``````The given string is non-empty.

If the answer does not exist, then return -1.

The given number does not contain any leading zeros.
``````
##### Input Format:
``````The first line of the input contains an integer T denoting the number of test cases.

The first and the only line of each test case contains a string S representing the number.
``````
##### Output Format:
``````The only line of output of each test case should print the number which is just greater than the given number as described above
``````
##### Note:
``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 100
1 <= len(S) <= 10^4
Time Limit: 1 sec
``````
• Q3. Circular Move

#### The sequence of moves contains only three types of moves.

``````'G': it means that the robot will move 1 unit in the direction it is facing.

'L': it means that the robot will move 90 degrees towards its left. For example, if the robot is facing north and it has to make an ‘L’ move, then it will start facing the west direction.

'R': it means the robot will move 90 degrees towards its right. For example, if the robot is facing north and it has to make an ‘R’ move then it will start facing the east direction.
``````
##### Input Format:
``````The first line contains an integer 'T' which denotes the number of test cases/queries to be run.
Then the test cases follow.

The first and the only line of input for each test case/query contains a string representing the sequence of moves.
``````
##### Note:
``````The sequence of moves will always be:
1. A valid one.

2. In uppercase characters without spaces in between.
``````
##### Output Format:
``````For each test case, print a single line containing ‘True’ if the sequence of moves is circular, print ‘False’ otherwise(without quotes).

The output for every test case will be printed in a separate line.
``````
##### Note:
``````You do not need to print anything, it has already been taken care of. Just implement the function.
``````
##### Constraints:
``````1 <= T <= 100
0 <= N <= 10 ^ 4

All the characters of the string will be ‘L’, ‘R’, and ‘G’.

Time Limit: 1 sec.
``````
• Q4. Basic HR Questions

Introduce yourself

Why you wanna join this company

Tell us your weakness and strength

### Interview details

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreProposed: Eligibility criteriaNo criteria
Capgemini interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 120 minutes
Round difficulty - Easy
Round description -

This was MCQ+Coding round.

Round 2
Round type - Face to Face
Round duration - 30 minutes
Round difficulty - Easy
Round description -

This was face to face interview round.

Round 3
Round type - HR Round
Round duration - 20 minutes
Round difficulty - Easy
Round description -

This round is basically on zoom meet .

Capgemini interview preparation:Topics to prepare for the interview - Basic Computer Science background ,Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Tip 4 : Do practice a lot of data structures questions as mostly questions in interviews are based on them

Application resume tips for other job seekers

Tip 1 : Add projects and Internships if you have done any and add only those things which you really know.
Tip 2 : Highlight most important skills and points in your resume
Tip 3 : Provide certificate of only important things

Final outcome of the interviewSelected
View More  ### Interview Rounds

Coding Test

Face to Face

I was interviewed in Jan, 2021.

### Interview Questions

• Q1. Find Duplicate

#### 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.
``````
##### Input format :
``````The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.

First line of each test case or query contains an integer 'N' representing the size of the array/list.

Second line contains 'N' single space separated integers representing the elements in the array/list.
``````
##### Output Format :
``````For each test case, print the duplicate element in the array/list.

Output for every test case will be printed in a separate line.
``````
##### Constraints :
``````1 <= t <= 10^2
0 <= N <= 10^3
Time Limit: 1 sec
``````
• Q2. Minimum operations to make strings equal

#### You have been given two strings A and B consisting of lower case English letters. The task is to count the minimum number of pre-processing moves on the string A required to make it equal to string B after applying below operations:

``````1. Choose any index i (0 <= i < n) and swap characters a[i]  and b[i].
2. Choose any index i (0 <= i < n) and swap characters a[i]  and a[n-i-1] .
3. Choose any index i (0 <= i < n) and swap characters b[i]  and b[n-i-1] .
``````

#### In one preprocess move, you can replace a character in A with any other character of the English alphabet.

##### Note:
``````1. The number of changes you make after the preprocess move does not matter.
2. You cannot apply to preprocess moves to the String B or make any preprocess moves after the first change is made.
``````
##### Input Format:
``````The first line of input contains an integer ‘T’ representing the number of test cases. Then the test cases follow.

The first line of each test case contains string A consisting of lowercase English letters.

The second line of each test case contains string B consisting of lowercase English letters.
``````
##### Output Format:
``````For each test case, print a single integer denoting the minimum number of pre-processing moves on the string A required to make it equal to the string B. Print -1, if it is impossible to make strings equal.

The output for each test case is in a separate line.
``````
##### Note:
``````You do not need to print anything; it has already been taken care of. Just implement the given fuction.
``````
##### Constraints:
``````1 <= T <= 100
1 <= N <= 5000

Where ‘N’ is the length of the strings.

Time Limit: 1 sec
``````
• Q3. Ways To Make Coin Change

#### You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a change for value V using coins of denominations from D. Print 0, if a change isn't possible.

##### Input Format
``````The first line of input contains an integer N, representing the total number of denominations.

The second line of input contains N integers values separated by a single space. Each integer value represents the denomination value.

The third line of input contains the value of V, representing the value for which the change needs to be generated.
``````
##### Output Format:
``````For each test case, print an integer denoting the total number of ways W, in which a change for V is possible.
``````
##### Note:
``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````

#### Constraints :

``````1 <= N <= 10
1 <= D[i] <=10^5
1 <= V <= 2 * 10^3

Where 'D[i]' represent the value of ith denomination.

Time Limit: 1sec
``````
• Q4. Puzzle

There are 2 cup with 5 lt and 6 lt of water respectively. The objective is to pour exactly 9 lt of water in a bucket. How can it be accomplished?

• Q5. Basic HR Questions

Tell me about yourself?
What do you consider to be your greatest strengths and weaknesses?

### Interview details

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreProposed: Eligibility criteriaNo
Capgemini interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 125 minutes
Round difficulty - Medium
Round description -

This online coding and mcq test is been held on Amcat site, which is an online platform for test. This round is not much difficult.

Round 2
Round type - Face to Face
Round duration - 40 minutes
Round difficulty - Easy
Round description -

This round is face to face round. This round is bit easy. In this round they first check our domain, then after they just check our communication skills.

Capgemini interview preparation:Topics to prepare for the interview - greedy algorithms, hash-map, trees and graphs , Data Structures and Algorithms, Arrays, Linked list, stack, queue, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Projects , aptitudeTime required to prepare for the interview - 3.6 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice all interview questions. Solve previously asked questions
Tip 2 : Prepare for domain subjects like Object-Oriented Programming System, Database Management System, Computer network
Tip 3 : Have good resume
Tip 4 : Have good projects and internships

Application resume tips for other job seekers

Tip 1 : Resume should be short and simple
Tip 2 : Keep resume of 1 or 2 page , not more than that.
Tip 3 : Any unwanted information on the resume leaves a bad impact
Tip 4 : Have good projects

Final outcome of the interviewSelected
View More  ### Interview Rounds

Coding Test

Face to Face

HR

I was interviewed in Jan, 2021.

### Interview Questions

• Q1. Maximum Difference

#### For example:

``````Given 'ARR' = [1, 10, 5, 2, 8, 1 ] , answer is "ODD".
Here the maximum difference is between 10 and 1, 10 - 1 = 9
``````
##### Input Format:
``````The first line of input contains an integer T’ denoting the number of test cases to run. Then the test case follows.

The first line of each test case contains ‘N’, the length of the array 'ARR'.

The second line of each test case contains ‘N’ space-separated elements of 'ARR'.
``````
##### Output Format:
``````For each test case, print a single line containing “ODD” without quotes if the maximum difference is odd else print “EVEN” without quotes.

The output for each test case is printed in a separate line.
``````
##### Note:
``````You don’t need to print anything. It has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 100
1 <= N <= 5000
1 <= ARR[i] <= 10 ^ 9

where ‘N’ is the length of the array 'ARR', and 'ARR[i]' is an element of the 'ARR' respectively.

Time limit: 1 sec.
``````
• Q2. Missing Number

#### Note

``````1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.
``````

#### Example:

``````Consider N = 5 and the list ‘binaryNums’=  [“0”, “01”, “010”, “100”, “101”].  This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.
``````
##### Input format:
``````The first line of input contains an integer ‘T’ denoting the number of test cases. then ‘T’ test cases follow.

The first line contains single integers ‘N’ represent the size of the list ‘BINARYNUMS’.

The second line contains ‘N’ space-separated string representing the list ‘BINARYNUMS’.
``````
##### Output format :
``````For each test case, print a single line containing a single string that represents this ‘Missing Integer’ in binary without leading zeros.

The output of each test case will be printed in a separate line.
``````

#### Note:

``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 50
1 <= N <= 10 ^ 4

Where ‘T’ is the total number of test cases and ‘N’ is the size of list ‘BINARYNUMS’

Time limit: 1 sec.
``````
• Q3. DBMS Questions

What are the different types of languages that are available in the DBMS?
Explain the concepts of a Primary key and Foreign Key.
What is the concept of sub-query in terms of SQL?
What is a checkpoint in DBMS?

• Q4. OS Questions

What is the main purpose of an operating system?
What is monolithic kernel?

• Q5. Basic HR Questions

Describe who you are? or Tell me about your background.

What are your strengths and weaknesses?

### Interview details

Professional and academic backgroundI applied for the job as Software Engineer in PuneProposed: Eligibility criteriaNo creiteria
Capgemini interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 135 minutes
Round difficulty - Medium
Round description -

This round is little bit difficult, but if your concepts were clear then you can clear any coding round. Coding is basically all related to clear concepts.

Round 2
Round type - Face to Face
Round duration - 40 minutes
Round difficulty - Easy
Round description -

This round is quite easy.

Round 3
Round type - HR Round
Round duration - 20 Minutes
Round difficulty - Easy
Round description -

This round was easy. In this round they basically ask simple question about me and my projects. May be they just want to check my communication skills.

Capgemini interview preparation:Topics to prepare for the interview - Data Structures, OOPS, DBMS, Algorithms, DP, Greedy ,Computer network, C++, DBMS, SQL, cloud computing ,Aptitude, Verbal, Pointers, ArraysTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Practice interview related questions
Tip 2 : Before going for interview revise all domain section
Tip 3 : learn at least one programming language
Tip 4 : have good projects and internship on your resume

Application resume tips for other job seekers

Tip 1 : Always be honest in resume, never lie in resume, if they caught you it will be bad impression
Tip 2 : Add your projects, internships or experience it will leave good impact
Tip 3 : Resume should be short and simple

Final outcome of the interviewSelected
View More ## Jobs at Capgemini ### Interview Rounds

Coding Test

I was interviewed before Nov, 2020.

### Interview Questions

• Q1. Aptitude

We have to put the ball in the hole in minimum movement of the tiles.

• Q2. Yogesh And Primes

#### Note: A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

##### Input format :
``````The first line of input contains one positive integer Q.
The following Q lines contains three spaced-separated integers A, B and K.
``````
##### Output format :
``````For each query, print the answer in a new line, if it exists, else print −1.
``````
##### Constraints:
``````1≤Q≤100,000
1≤A≤B≤1,000,000
1≤K≤1,000,000
A≤P≤B
``````
• Q3. Rat In A Maze

#### You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a square matrix of order 'N' * 'N' where the cells with value 0 represent the maze’s blocked locations while value 1 is the open/available path that the rat can take to reach its destination. The rat's destination is at ('N' - 1, 'N' - 1). Your task is to find all the possible paths that the rat can take to reach from source to destination in the maze. The possible directions that it can take to move in the maze are 'U'(up) i.e. (x, y - 1) , 'D'(down) i.e. (x, y + 1) , 'L' (left) i.e. (x - 1, y), 'R' (right) i.e. (x + 1, y).

##### Note:
``````Here, sorted paths mean that the expected output should be in alphabetical order.
``````
##### For Example:
``````Given a square matrix of size 4*4 (i.e. here 'N' = 4):
1 0 0 0
1 1 0 0
1 1 0 0
0 1 1 1
Expected Output:
DDRDRR DRDDRR
i.e. Path-1: DDRDRR and Path-2: DRDDRR

The rat can reach the destination at (3, 3) from (0, 0) by two paths, i.e. DRDDRR and DDRDRR when printed in sorted order, we get DDRDRR DRDDRR.
``````
##### Input format:
``````The first line contains an integer 'N', which denotes the dimensions of the square matrix (maze).

Then 'N' lines follow. Each line contains 'N' space-separated integers denoting the values which would either be 0 denoting a blocked path or 1 denoting the available path in the maze, respectively.
``````
##### Output format:
``````For the given maze, print the vector/list of strings representing all the possible paths that the rat can take to reach from source to destination in the maze in sorted order.

Output for each test case will be printed in a separate line.
``````
##### Note:
``````You do not need to print anything. It has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````2 <= N <= 5
0 <= MATRIX[i][j] <= 1

Where N is the size of the square matrix.

Time Limit: 1sec
``````

### Interview details

Professional and academic backgroundI applied for the job as Junior analyst in NoidaProposed: Eligibility criteria60%
Capgemini interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 90 Minutes
Round difficulty - Easy
Round description -

It was an online test which had different rounds

Capgemini interview preparation:Topics to prepare for the interview - Data structure, Dbms, Java, oops and sdlcTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : prepare data structure
Tip 2 : prepare dbms
Tip 3 : be confident

Application resume tips for other job seekers

Tip 1 : your positive only
Tip 2 : prepare your cv topics

Final outcome of the interviewRejected
View More  ### Interview Rounds

Coding Test

Face to Face

HR

I was interviewed in Feb, 2021.

### Interview Questions

• Q1. KthLargestNumber

#### The implemented data structure must support the following operations:

``````1. add(DATA) :
This function should take one argument of type integer
and store it in its pool.
2. int getKthLargest() :
This function should return the kth largest number from
the current pool of integers.
``````

#### You will be given q queries of 2 types:

``````1. 1 val - For this type of query, you need to insert the integer into your current pool of integers
2. 2 - For this type of query, you need to return the kth largest integer from the current pool of integers.
``````
##### Note
`````` 1. The maximum number of integers that will be given will always be under memory limits.
2. You will also be given an initial pool of integers whose size will be equal to k.
3. The maximum queries of type 1 will be less than 10^5.
4. The kth largest element is not the kth distinct element but the kth largest element in the sorted order.
5. There will be at least one query of type 2.
``````
##### Input Format:
``````The first line contains two space-separated integers 'Q’ and ‘K’,  where Q denotes the number of queries which will be run against the implemented data structure.

The second line will contain ‘K’ space-separated integers which will be the initial pool of integers.

Then Q lines follow. The i-th line contains the i-th query in the format as in the problem statement

For the query of the first type, the input line will contain two integers ‘QUERYTYPE’ and ‘DATA’ separated by a single space, representing the type of the operation in integer and the integer data to be included in the pool respectively.

For the rest of the queries, the input line will contain only one integer value, representing the query being performed.
``````
##### Output Format:
``````For Query-1, you do not need to return anything.

For Query-2, prints the kth largest integer from the current pool.

The output of each query of type 2 has to be printed in a separate line.
``````
##### Note:
``````You do not need to print anything, it has already been taken care of. Just implement the given functions.
``````
##### Constraints:
``````1 <= Q <= 10 ^ 4
1 <= K <= 10 ^ 5
1 <= QUERYTYPE <= 2
1 <= DATA <= 10 ^ 9

Time Limit: 1 sec.
``````
• Q2. DBMS Questions

What is a semaphore?
What is race condition?
Describe all the joins in SQL with a Venn diagram.

• Q3. Basic HR Questions

Why did you decide to apply to this role?
What did you like most about the job description?
What do you know about our company’s product/services

### Interview details

Proposed: Eligibility criteriaNo Backlogs
Capgemini interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 40 minutes
Round difficulty - Medium
Round description -

It was in the morning. The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 40mins.Questions were mainly from Data structure, OS, DBMS, SQL.

Round 2
Round type - Face to Face
Round duration - 30 minutes
Round difficulty - Easy
Round description -

The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from DBMS, OS

Round 3
Round type - HR Round
Round duration - 15 minutes
Round difficulty - Easy
Round description -

It was in the evening. Interviewer first ask simple questions to keep me calm and it was nice interaction with her the environment created by her was very interesting to answer

Capgemini interview preparation:Topics to prepare for the interview - Aptitude, SQL, Data structure, Dynamic Programming, Recursion, C++, Logical reasoning, Data StructuresTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Read interview experience before interview
Tip 2 : Think loud about each coding question.
Tip 3 : Practice as much as you can

Application resume tips for other job seekers

Tip 1 : Resume should look nice and in proper format
Tip 2 : Each skill should be mentioned properly.

Final outcome of the interviewSelected
View More  Contribute to the growing community

Don’t worry. You can choose to be anonymous.