Capgemini

3.8
i
Capgemini overall rating is based on 15.6k company reviews, including all divisions and wholly owned subsidiaries.

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

Engaged employer
?
This company page is being actively managed by Capgemini Team. If you also belong to the team, you can get access from here
Filter interviews by
Designation

Select Designation

Clear

1.1k results found

Interview Rounds

Video Call

HR

I was interviewed in Jun, 2021.

Interview Questions

  • Q1. Pascal's Triangle

    You are given an integer N. Your task is to return a 2-D ArrayList containing the pascal’s triangle till the row N.

    A Pascal's triangle is a triangular array constructed by summing adjacent elements in preceding rows. Pascal's triangle contains the values of the binomial coefficient. For example in the figure below.

    For example, given integer N= 4 then you have to print.

    1  
    1 1 
    1 2 1 
    1 3 3 1
    
    Here for the third row, you will see that the second element is the summation of the above two-row elements i.e. 2=1+1, and similarly for row three 3 = 1+2 and 3 = 1+2.
    
    Input format :
    The first line of input contains an integer ‘T’ denoting the number of test cases.
    The first line of each test case contains a single integer N denoting the row till which you have to print the pascal’s triangle.
    
    Output format :
    For each test case, return the 2-D array/list containing the pascal’s triangle till the row N.
    
    Note:
    You do not need to print anything; it has already been taken care of. Just implement the given function.
    
    Constraints:
    1 <= T <= 40
    1 <= N <= 50
    
    Time Limit: 1 sec
    
  • Q2. OOPS Question

    What is meant by Interface?

  • Q3. OOPS Question

    Difference between Abstract class and Interface.

  • Q4. SpringBoot Question

    What is the starter dependency of the Spring boot module?

  • Q5. SpringBoot Question

    What does the @SpringBootApplication annotation do internally?

  • Q6. SpringBoot Question

    Can we override or replace the Embedded tomcat server in Spring Boot?

  • Q7. DBMS Question

    What is the difference between Cluster and Non-Cluster Index?

  • Q8. DBMS Question

    Difference between the DELETE and TRUNCATE command in a DBMS.

  • Q9. Selenium Question

    Explain the difference between driver.close() and driver.quit() command in Selenium?

  • Q10. Selenium Question

    Explain the difference between findElement() and findElements() in Selenium.

  • Q11. OOPS Question

    What is Garbage collector in JAVA?

  • Q12. Basic HR Question

    Tell me something not there in your resume.

  • Q13. Basic HR Question

    Why should we hire you ?

Interview details

Proposed: Eligibility criteriaAbove 2 years of experience
Capgemini interview Rounds:Round 1
Round type - Video Call
Round duration - 60 Minutes
Round difficulty - Medium
Round description -

This round had 1 simple question related to Basic Programming and Maths and then I was asked some concepts revolving around Java , Spring Boot and OOPS.


Round 2
Round type - Video Call
Round duration - 60 Minutes
Round difficulty - Medium
Round description -

This round focused more on concepts from DBMS , OOPS and Selenium. The interviewer was more aligned towards the fundamentals and asked the core concepts rather than some advanced questions.


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

This was a typical HR round with some standard Behavioral questions .

Capgemini interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude,Java, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected
View More
track
Analyst interview
track

Interview Rounds

Face to Face

I was interviewed in Aug, 2021.

Interview Questions

  • Q1. Next greater element

    For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of X in the array, which is greater than X. If no greater elements exist to the right of X, consider the next greater element as -1.

    For example:
    For the given array [7, 12, 1, 20]
    
    - The next greater element for 7 is 12.
    - The next greater element for 12 is 20. 
    - The next greater element for 1 is 20. 
    - There is no greater element for 20 on the right side.
    
    Output: [12, 20, 20, -1]
    
    Input Format:
    The first line of input contains an integer 'N' representing the size of the array/list.
    
    The second line of input contains 'N' single space-separated integers representing the elements of the array/list.
    
    Output Format :
    The only line of output contains 'N' single space-separated integers representing the Next Greater Element for each element. 
    
    Note :
    You do not need to print anything explicitly, it has already been taken care of.
    
    Constraints :
    1 <= N <= 10^5
    1 <= ARR[i] <= 10^9
    
    Time Limit: 1 sec
    
  • Q2. OS Questions

    1) Explain the difference between process, program and a thread.
    2) Explain virtualisation.
    3) Do we use virtualisation in everyday computers, if so how?
    4) What are some commonly used page scheduling algorithms ?
    5) Explain the difference between LRU and MRU algorithms?

    Add Answer Collapse
  • Q3. Kth Largest Element

    Ninja loves playing with numbers. One day Alice gives him some numbers and asks him to find the Kth largest value among them.

    Input Format:
    The first line of input contains an integer ‘T,’ denoting the number of test cases. The test cases follow.
    
    The first line of each test case contains two space-separated integers, ‘N’ and ‘K’, denoting the number of elements in the array and the index of the largest number to be found respectively.
    
    Output Format:
    For each test case, print an integer denoting the Kth largest number.
    
    Print the output of each test case in a separate line.
    
    Note:
    You are not required to print the expected output; it has already been taken care of. Just implement the function.
    
    Constraints:
    1<= T <= 50
    1 <= K <= N <= 10^4
    1 <= array[i] <= 10^5
    
    Time Limit: 1 sec
    
  • Q4. Two sum

    You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

    Note:

    We cannot use the element at a given index twice.
    
    Follow Up:
    Try to do this problem in O(N) time complexity. 
    
    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 two single space-separated integers ‘N’ and ‘Target’ denoting the number of elements in an array and the Target, respectively.
    
    The second line of each test case contains ‘N’ single space-separated integers, denoting the elements of the array.
    
    Output Format :
    For each test case, print a single line containing space-separated integers denoting all pairs of elements such that they add up to the target. A pair (a, b) and (b, a) is the same, so you can print it in any order.
    
    Each pair must be printed in a new line. If no valid pair exists, print a pair of (-1, -1). Refer to sample input/output for more clarity.
    

    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 <= N <= 5000
    -10 ^ 9 <= TARGET <=10 ^ 9
    -10 ^ 9 <= ARR[i] <=10 ^ 9
    
    Where 'T' denotes the number of test cases, 'N' represents the size of the array, 'TARGET' represents the sum required, and 'ARR[i]' represents array elements.
    
    Time Limit: 1 sec.
    
  • Q5. DBMS And OS Questions

    1) Explain normalisation.
    2) Difference between foreign and candidate key.
    3) Difference between BCNF and 3NF.
    4) Memory Protection in OS 
    5) Explain pipelining.

    Add Answer Collapse

Interview details

Professional and academic backgroundI completed Information Technology from Delhi University. Proposed: Eligibility criteriaAbove 7 CGPA
Capgemini interview Rounds:Round 1
Round type - Face to Face
Round duration - 40 minutes
Round difficulty - Easy
Round description -

This round had 1 programming question, and I was grilled on the questions for OS.


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

This was the second round and there were 2 programming questions and some questions on DBMS , OS and Unix.

Capgemini interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected
View More
track
Analyst interview
track

Interview Rounds

Video Call

HR

I was interviewed in Aug, 2021.

Interview Questions

  • Q1. Trailing Zeros in Factorial

    You are given an integer N, you need to find the number of trailing zeroes in N! (N factorial).

    Note:

    1. Trailing zeros in a number can be defined as the number of continuous suffix zeros starting from the zeroth place of a number.
    2. For example, if a number X = 1009000, then the number of trailing zeros = 3 where the zeroth place is 0, the tenth place is 0, the hundredth place is 0.
    3. ! means “FACTORIAL”. Factorial of a number is calculated by the product of the integer and all integers below it till 1.
    4. Value of 0! is 1.
    
    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 an integer N, denoting the number whose number of trailing zeros from N! is to be found.
    
    Output Format:
    The only line of output of each test case should contain an integer, denoting the number of trailing zeroes in N!
    
    Note:
    You do not need to print anything, it has already been taken care of. Just implement the given function.
    
    Constraints:
    1 <= T <= 10^4
    1 <= N <= 10^9
    
    Time Limit: 1sec
    
  • Q2. Java Question

    How would you differentiate between a String, StringBuffer, and a StringBuilder?

  • Q3. Java Question

    What is classloader?

  • Q4. Java Question

    Why are Java Strings immutable in nature?

  • Q5. Technical Question

    What is Latency in API testing?

  • Q6. Java Question

    Explain the Life Cycle of a Thread in Java .

  • Q7. Java Question

    Why Java is platform independent and JVM platform dependent?

  • Q8. Selenium Question

    What are Junit annotations?

  • Q9. Selenium Question

    What are the limitations of Selenium?

  • Q10. Selenium Question

    Explain the various navigation commands supported by Selenium.

  • Q11. Basic HR Question

    Tell me something not there in your resume.

Interview details

Proposed: Eligibility criteriaAbove 2 years of experience
Capgemini interview Rounds:Round 1
Round type - Video Call
Round duration - 60 Minutes
Round difficulty - Medium
Round description -

This round consisted of 1 question from DSA and the rest of them were related to Java and API Testing.


Round 2
Round type - Video Call
Round duration - 60 Minutes
Round difficulty - Medium
Round description -

Standard OS questions related to Java were asked in this round followed by some questions from Selenium and JUnit.


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

This was a typical HR round with some standard Behavioral questions .

Capgemini interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected
View More
track

Jobs at Capgemini

Electronics Engineer interview
track

Interview Rounds

Video Call

HR

I was interviewed before Dec, 2020.

Interview Questions

  • Q1. Kth Largest Number

    You will be given a stream of numbers, and you need to find the kth largest number in the stream at any given time.

    As the stream of numbers can not be given during compile time, so you need to design a data structure which can accept infinite numbers and can return the kth largest number at any given time.

    The stream of numbers is nothing but a large collection of numbers from which integers are read at runtime, such as the user will never know the upper limit on the number of integers which will be read.

    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. OOPS Question

    What is an interface?

  • Q3. OOPS Question

    Explain SOLID principles in Object Oriented Design .

  • Q4. OS Question

    Explain Piping in Unix/Linux

  • Q5. OS Question

    What do chmod, chown, chgrp commands do?

  • Q6. OS Question

    Explain any 5 essential UNIX commands .

  • Q7. SpringBoot Question

    How to enable Actuator in Spring boot application?

  • Q8. SpringBoot Question

    What is Spring Boot starter? How is it useful?

  • Q9. SpringBoot Question

    What is dependency Injection?

  • Q10. DBMS Question

    What is Self-Join and Cross-Join ?

  • Q11. DBMS Question

    What are views in SQL?

  • Q12. Basic HR Question

    Why should we hire you ?

  • Q13. Basic HR Question

    Why are you looking for a job change?

Interview details

Proposed: Eligibility criteriaAbove 2 years of experience
Capgemini interview Rounds:Round 1
Round type - Video Call
Round duration - 60 Minutes
Round difficulty - Medium
Round description -

This round consisted of questions from DS/Algo , OOPS and Operating Systems primarily usage of some basic UNIX commands .


Round 2
Round type - Video Call
Round duration - 60 Minutes
Round difficulty - Medium
Round description -

This round had questions revolving around OS , Selenium and some common concepts from DBMS. The interviewer was quite experienced and made the whole interview quite wholesome for me.


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

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Capgemini interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Java , Selenium , Spring Boot, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected
View More
track
Oracle Database Administrator interview
track

Interview Rounds

Coding Test

Face to Face

HR

I was interviewed before Dec, 2020.

Interview Questions

  • Q1. Ninja And His Secret Information

    Ninja has recently joined the FBI. Ninja got some secret information ‘SECRET_INFORMATION’ which he wants to share with his team. But he can not send this information directly because of the hackers and security threats they pose.

    So Ninja decides to encode this ‘SECRET_INFORMATION’ and then send the encoded ‘SECRET_INFORMATION’ to his team members. This way, only his team members can decode this information and thus share it safely.

    As Ninja is busy extracting the ‘SECRET_INFORMATION, he asks you for help.

    Can you help Ninja and his friends with encoding and decoding the ‘SECRET_INFORMATION’?

    Note:

    1. The ‘SECRET_INFORMATION’ may contain any possible character out of 256 valid ASCII characters.
    2. While decoding the ‘SECRET_INFORMATION’ do not use class members / global/static variables.
    3. Do not use any inbuilt library method/function for decoding the ‘SECRET_INFORMATION’.
    
    Input Format:
    The first line of input contains an integer ‘T’ which denotes the number of test cases or queries to be run. Then the test cases follow.
    
    The first and the only line of each test case contains an input string ‘STR’ 
    
    Output Format :
    For each test case, design an algorithm that returns the encoded and decoded string for each input ‘SECRET_INFORMATION’. The output is “Transmission successful” if decoding the encoded string gives the same string as ‘SECRET_INFORMATION’ else the output is “Transmission failed”. 
    
    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’ <= 100
    1 <= |SECRET_INFORMATION| <= 5000
    
    Where ‘T’ denotes the total number of test cases and |SECRET_INFORMATION| represents the length of ‘SECRET_INFORMATION’ Ninja has to transfer to his team.
    
    Time Limit: 1 second
    
  • Q2. Technical Questions

    SQL join to your database query

    What is polymorphism

    Add Answer Collapse
  • Q3. Equilibrium Index

    You are given an array Arr consisting of N integers. You need to find the equilibrium index of the array.

    An index is considered as an equilibrium index if the sum of elements of the array to the left of that index is equal to the sum of elements to the right of it.

    Note:

    1. The array follows 0-based indexing, so you need to return the 0-based index of the element.
    2. Note that the element at the equilibrium index won’t be considered for either left sum or right sum.
    3. If there are multiple indices which satisfy the given condition, then return the left-most index i.e if there are indices i,j,k…. which are equilibrium indices, return the minimum among them
    4. If no such index is present in the array, return -1.
    
    Input Format:
    The first line of the input contains an integer T, denoting the number of test cases.
    The first line of each test case contains the integer N, denoting the size of the array.
    The second line of each test case contains N space-separated integers denoting the array elements.
    
    Output Format:
    The only line of output of each test case contains a single integer which corresponds to the equilibrium index for the array.
    

    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^5
    -10^4 <= Arr[i] <= 10^4
    Time Limit: 1 sec
    
  • Q4. Basic HR Questions

    Tell me about yourself.

    Why should we hire you?

    What keeps you motivated?

    Add Answer Collapse

Interview details

Professional and academic backgroundI applied for the job as Data Analyst in PuneProposed: Eligibility criteria7 CGPA
Capgemini interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 120 Minutes
Round difficulty - Medium

Round 2
Round type - Face to Face
Round duration - 60 Minutes
Round difficulty - Medium

Round 3
Round type - HR Round
Round duration - 50 Minutes
Round difficulty - Easy
Capgemini interview preparation:Topics to prepare for the interview - Data Structures, OOPS, SQL, Python, JavaTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Focus more on SQL
Tip 2 : Keep up with ongoing projects in the company

Application resume tips for other job seekers

Tip 1 : Be honest about what you add.
Tip 2 : Don't forget to mention extra curriculars.

Final outcome of the interviewSelected
View More
track
Electronics Communication Engineer interview
track

Contribute to the growing community

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

Report Interview Advice

What’s wrong with this interview advice?