Interview experience
Capgemini Interview Questions and Answers (2026)
Overview
Section titled “Overview”Capgemini’s fresher process opens with an unusual game-based pseudocode round before a normal coding-and-interview pipeline, and your combined performance across every stage - not a separate application - decides whether you land the Analyst, Analyst*, or Senior Analyst profile.
Capgemini interview process at a glance
Section titled “Capgemini interview process at a glance”| Round | Duration | What they test |
|---|---|---|
| Game-Based Assessment | ~25 min | Pseudocode MCQs - loop tracing, conditional/array logic |
| Hands-on Coding | ~45 min | 2 programming problems (C/C++/Java/Python) |
| Technical Interview | 30-45 min | OOPs, DBMS, OS, networking, project deep-dive |
| HR Interview | 20-30 min | Personality, communication, career goals, relocation |
Game-Based Assessment
Section titled “Game-Based Assessment”About 15 pseudocode MCQs in 25 minutes - you read a short block of pseudocode (loops, conditionals, array traversal) and predict its output by tracing it in your head or on paper, with no code editor to run it in.
Common questions
- Output prediction from a
WHILE/FORloop with an accumulator variable - Nested conditional statement outputs
- Array-traversal and index-tracking results
- String-manipulation trace questions (concatenation, character counting)
Hands-on Coding
Section titled “Hands-on Coding”Two programming problems, roughly 45 minutes total, in a language of your choice (C, C++, Java, or Python). Problems are Easy to Easy-Medium - candidates who solve one fully and get partial credit on the second still commonly clear this round if the game-based score was strong.
Common questions
- Reverse an array (two-pointer swap)
- Check for an Armstrong number
- Palindrome check on a string or number
- Find the second-largest element in an array
- Factorial and Fibonacci series implementations
Round-by-round breakdowns are on the Capgemini interview experience page.
Technical Interview
Section titled “Technical Interview”Opens with a brief self-introduction, then moves into programming fundamentals, DBMS, and a detailed walkthrough of your final-year or academic project - approach over syntax matters more than memorized definitions.
Common questions
- Difference between C and Java; explain the four pillars of OOPs with examples
- Difference between stack and queue; array vs linked list
- DBMS - what is normalization; write a SQL query using JOIN
- Detailed project discussion - technologies used, your specific role, challenges faced
HR Interview
Section titled “HR Interview”A shorter, comparatively easy closing round focused on personality, communication, and motivation rather than technical depth.
Common questions
- Why Capgemini? (global presence, diverse projects, learning opportunities)
- Are you comfortable with relocation?
- What are your strengths and weaknesses?
- Where do you see yourself in five years?
- Any questions for us? (training program, project allocation)
Sample answer frameworks for each of these are on the Capgemini HR interview questions page.
Analyst vs Analyst* vs Senior Analyst: how the profile gets decided
Section titled “Analyst vs Analyst* vs Senior Analyst: how the profile gets decided”Unlike companies where you apply to a specific role, Capgemini doesn’t let you pick your offer profile up front. Your combined performance across the game-based assessment, hands-on coding, and both interviews determines whether you land Analyst, the higher Analyst* tier, or Senior Analyst - the profile with the largest pay gap (roughly Rs 4.25 LPA vs Rs 7.5 LPA) and the one most often awarded to candidates with strong internship or project depth on top of a clean technical interview. Since there’s no separate application for the higher tiers, treating every stage - including the often-underestimated pseudocode round - as equally high-stakes is the highest-leverage strategy.
Common technical interview questions and answers
Section titled “Common technical interview questions and answers”Q: Explain the four pillars of OOPs with examples
Encapsulation binds data and the methods that operate on it inside one unit and hides internal state behind private fields with public getters and setters - a BankAccount class exposing deposit and withdraw but keeping balance private. Abstraction exposes only what a caller needs and hides implementation, expressed through abstract classes and interfaces, such as a Shape interface declaring area() while Circle and Square implement it differently. Inheritance lets a derived class reuse a base class’s members, so a Car class extends Vehicle rather than repeating its fields. Polymorphism lets one interface take many forms - compile-time through method overloading (same name, different parameter lists) and runtime through method overriding, where the JVM dispatches to the subclass implementation based on the actual object type.
Q: What is the difference between C and Java?
C is a procedural, compiled language producing platform-specific machine code, while Java is object-oriented and compiles to bytecode that runs on the JVM, giving it write-once-run-anywhere portability. C requires manual memory management through malloc and free and gives direct pointer arithmetic, whereas Java has automatic garbage collection and no explicit pointers, which removes whole classes of memory bugs. C has no built-in exception handling or threading in the language itself, while Java provides try-catch-finally and a threading model in the standard library. C is preferred for systems and embedded work where control and footprint matter; Java dominates enterprise application development, which is why IT-services interviewers ask this.
Q: Difference between stack and queue, and array versus linked list
A stack is LIFO - last in, first out - with push and pop at one end, used for function-call frames, undo history and expression evaluation. A queue is FIFO - first in, first out - with enqueue at the rear and dequeue at the front, used for scheduling and buffering. Both give O(1) insert and remove. An array stores elements in contiguous memory, so indexing is O(1) but inserting or deleting in the middle is O(n) because elements must shift, and its size is fixed at allocation. A linked list stores nodes with pointers, so insert or delete at a known position is O(1) but access requires walking the list at O(n), and it costs extra memory per node for the pointer.
Q: Reverse an array in place and find the second-largest element
To reverse in place, set left to 0 and right to the last index, swap the two elements, then move left forward and right backward until they meet - that is O(n) time and O(1) space, and it avoids the extra array a naive copy-backwards approach would allocate. For the second largest, do one pass keeping two variables, largest and secondLargest, both initialised to negative infinity: if the current element is greater than largest, push largest into secondLargest and update largest, else if it is greater than secondLargest and not equal to largest, update secondLargest. That is O(n) with a single pass, better than sorting at O(n log n). The edge case interviewers check is an array where all elements are identical, where no second largest exists.
Q: How do you check for an Armstrong number and a palindrome?
An Armstrong number of n digits equals the sum of its own digits each raised to the power n - 153 works because 1 cubed plus 5 cubed plus 3 cubed equals 153. Count the digits first, then loop extracting each digit with n % 10 and n / 10, accumulating the powered sum, and compare it to the original. A number palindrome is checked by reversing the number the same way, using rev = rev * 10 + digit, and comparing with the original - note you must copy the original first because the loop destroys it. A string palindrome is cheaper: two pointers from both ends comparing characters and moving inward, O(n) time and O(1) space, with no reversed copy needed.
Q: How do you trace pseudocode output in the Game-Based Assessment?
Build a small table on paper with one column per variable and one row per iteration, and write down every value as it changes rather than tracking it mentally - that is what the round actually measures. Watch the three traps that account for most wrong answers: whether the loop condition is checked before or after the body (a repeat-until runs at least once, a while may run zero times), whether the counter uses pre-increment or post-increment inside an expression, and whether array indexing starts at 0 or 1 in the given pseudocode dialect. For nested loops, evaluate the inner loop fully for each single outer iteration. If time is short, trace only the first two iterations and the last one, since the answer options usually differ at the boundaries.
Q: What is normalization in DBMS?
Normalization organises tables to remove redundancy and the insert, update and delete anomalies redundancy causes. 1NF requires every column to hold atomic values with no repeating groups. 2NF additionally removes partial dependencies, where a non-key column depends on only part of a composite primary key. 3NF removes transitive dependencies, where a non-key column depends on another non-key column - for example, keeping emp_id, dept_id and dept_name together is a 3NF violation because dept_name follows dept_id. BCNF is the stricter form requiring every determinant to be a candidate key. The practical tradeoff is that more normalization means more joins, so reporting systems often denormalize on purpose.
Q: Write a SQL query using JOIN to list employees with their department names
SELECT e.emp_name, d.dept_name FROM employees e INNER JOIN departments d ON e.dept_id = d.dept_id; An INNER JOIN returns only rows matching in both tables, so an employee with a null dept_id disappears from the result. A LEFT JOIN keeps every employee and fills dept_name with NULL when there is no match, which is what you want if the question asks for all employees including the unassigned. A common follow-up is counting employees per department: SELECT d.dept_name, COUNT(e.emp_id) FROM departments d LEFT JOIN employees e ON d.dept_id = e.dept_id GROUP BY d.dept_name; - use COUNT on the employee column rather than COUNT(*) so empty departments correctly show zero.
Frequently asked questions about Capgemini interviews
Section titled “Frequently asked questions about Capgemini interviews”What is the Capgemini interview process for freshers?
Capgemini’s Exceller/Engineering process usually runs four stages: a Game-Based Assessment (about 25 minutes, ~15 pseudocode MCQs testing logical thinking - trace loops, conditionals, and array traversal by hand); Hands-on Coding (about 45 minutes, 2 programming problems in a language of your choice - C/C++/Java/Python); a Technical Interview (30-45 minutes) on programming fundamentals, DBMS, OS, and your projects; and a closing HR Interview (20-30 minutes). Minimum academic cutoffs (commonly around 65% through 10th/12th/UG) and no active backlogs typically apply.
What is Capgemini’s Game-Based Assessment and why does it matter?
It’s a roughly 25-minute round of about 15 pseudocode MCQs where you trace through loop, conditional, and array-traversal logic by hand and predict the output - there’s no code editor, just careful tracing under time pressure. Candidates who treat it as a throwaway warm-up often get eliminated here even with strong coding skills, since it’s evaluated before the hands-on coding round.
What is the difference between Capgemini’s Analyst, Analyst*, and Senior Analyst profiles?
All three are offered off the same assessment and interview pipeline; which one you land depends on your overall performance across the game-based assessment, coding round, and interviews. Analyst is the standard entry profile (roughly Rs 4.25 LPA), Analyst* sits a tier higher with a stronger technical bar (roughly Rs 5.75 LPA), and Senior Analyst is reserved for the strongest candidates, often with prior internship or project depth (roughly Rs 7.5 LPA). You don’t choose a profile at registration - your assessment and interview performance decides it.
What questions are asked in Capgemini interviews?
The technical round leans on CS fundamentals - OOPs, DBMS, OS, networking - live or discussed coding (reverse an array, Armstrong number, prime check), and deep-dive questions on your academic projects and the technologies you used. The HR round is comparatively easy and focuses on communication, personality, and career motivation rather than technical depth.
How many rounds are there in the Capgemini interview?
Typically four: the Game-Based Assessment, Hands-on Coding, Technical Interview, and HR Interview. The game-based and coding rounds are the main elimination stages - you need to clear sectional and overall cutoffs in both to advance, and a partial coding score can still clear if your game-based score is strong.
How should I prepare for Capgemini interviews?
Practise tracing pseudocode by hand (loops, nested conditionals, array/string manipulation) since the game-based round has no code editor to lean on, solve basic-to-medium coding problems in your strongest language, revise OOPs/DBMS/OS/networking fundamentals, and prepare one clear project narrative you can explain end to end.