Learn from real Capgemini placement interview experiences. We synthesized campus reports into round tables and prep takeaways - game-based pseudocode, hands-on coding, then technical and HR. Patterns change often, so verify against your placement email.
Capgemini interview process overview
Game-Based Assessment (25 minutes)
15 pseudocode MCQs
Test logical thinking
Hands-on Coding (45 minutes)
2 coding problems
Languages: C, C++, Java, Python
Technical Interview (30-45 minutes)
Programming fundamentals
Project discussion
CS basics
HR Interview (20-30 minutes)
Behavioral questions
Company fit
Relocation
Round-wise process at a glance
Stage
Typical format
What eliminates candidates
Online assessment battery
Pseudocode + IT MCQs, English, 4 cognitive games, sometimes behavioral/PowerSkills
Source: consolidated from public student write-ups of Capgemini’s 2025-batch on-campus and Superset drives. The single most repeated line across accounts: every stage eliminates, and clearing one section does not compensate for a weak one.
Round 1 - Online assessment battery
Reported as several separately-timed sections in one sitting:
Roughly 75 questions in some accounts. Answer consistently rather than strategically
Round 2 - Coding assessment
Reported as top-performer gated - not everyone who clears Round 1 gets here. One 2025 write-up is candid that the candidate did not qualify for this stage at all.
Typically 2 problems; most mainstream languages supported
Difficulty reported as easy to medium, focused on fundamentals rather than heavy DSA
This round is what separates the higher-band offers from the base analyst track in several accounts
Round 3 - Communication assessment
A four-section spoken-English test. Reported tasks: read and repeat, listen and repeat, conversation comprehension, and a short speaking task on an assigned topic - typically 30 seconds to think and 45 seconds to speak, with no repeats.
Candidates warn that the audio plays once only, so attention matters as much as fluency. Treat this round as eliminative.
Round 4 - Technical interview (25-30 minutes)
Reported as resume-driven and fundamentals-heavy, not algorithmic. Actual reported questions cluster into:
Self-introduction and project walkthrough
Which languages you know, and language-specific follow-ups - C++ pointers, friend functions, writing a palindrome program in Python
SQL fundamentals: basic queries, primary vs foreign key, UNION vs UNION ALL
OOP concepts explained in your own words
SDLC methodologies - waterfall vs agile
Anything listed on the resume, including tools and certifications - one candidate was questioned on Google Analytics purely because it appeared on their CV
The most repeated advice: know every line of your own resume. Candidates report this being the decisive factor far more often than DSA skill.
Takeaways
What decided it: Clearing the game-based pseudocode gate, then fundamentals-honest technical communication over algorithm depth
Common fail: Skipping pseudocode/game formats, or claiming resume skills you cannot explain
How to practise: Drill Capgemini-style pseudocode MCQs under 25 minutes; two easy-medium codes; project fundamentals aloud
Interview experience 2: what varies across drives
Reported variations - off-campus and other tracks
Off-campus and pooled drives
Same assessment battery, applied through the Capgemini careers portal or a pooled-drive platform such as Superset
Reports describe longer gaps between rounds and less certainty about timelines than on-campus
The elimination-at-every-stage rule is reported identically here
Pattern changes to watch for
The game-based aptitude section is relatively recent. Older write-ups describing a 16-question logical-reasoning MCQ section reflect a pattern Capgemini has moved away from - be careful which year’s material you prepare from.
Some cycles include an essay task (commonly reported as ~250 words in ~25 minutes, on general topics such as environment, education or technology); others do not.
Whether an HR round is separate or folded into the technical interview varies by drive.
On compensation: offer levels differ by track and year, and the figures circulating on prep sites are not reliable. Your offer letter is the only source that counts.
Takeaways
What decided it: Confirming the current assessment pattern from the placement email when structures change across years
Common fail: Preparing from a single outdated write-up while the drive uses a different game/coding split
How to practise: Re-read the drive mail checklist the night before; keep one backup mock for alternate formats
Source: public Medium write-up (Institute of Engineering & Management, Kolkata campus drive). Useful for how A4 vs A4 vs A5* routing works when not everyone gets the coding round.
Online assessment (Day 1)
Multi-section Exceller test; results released same day for next steps
Candidates who miss the coding shortlist were in some cases routed toward communication (SVAR) only, making them ineligible for A4 and A5* bands per the author’s account
Coding round (Day 2, shortlisted only)
Two LeetCode easy-to-medium problems in 45 minutes on Superset
Described as the separator for higher package tiers
SVAR communication test
Taken by everyone still in the A4 / A4* / A5 pool after coding
Sections included sentence reading, sentence completion, and pronunciation checks
Technical interview (online, Superset)
OOP fundamentals
Questions on ChatGPT / staying current with AI tools
Deep final-year project walkthrough
Basic ML curiosity questions and introductory tree/graph prompts
Outcome reported: Selected as A4 Analyst; offer arrived ~one month after interview.
Key takeaways: Treat the coding shortlist as the fork for higher bands. Prepare a concise AI-tooling opinion (how you validate model output, academic integrity) - it appears in recent panels alongside classic OOP.
Sample answers for high-frequency questions
Use these as frames, not scripts - interviewers probe follow-ups.
Q. Explain the four pillars of OOPs with examples A. 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? A. 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. 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 A. 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? A. 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.
Tips from successful candidates
Assessment tips
Confirm the current Capgemini pattern from the drive mail before practising old papers
Finish one problem or section fully before starting the next
Revise the fundamentals listed in the round table on this page
Interview tips
Narrate trade-offs; expect “why” after every answer
Only list projects you can defend under follow-ups
Prepare 3-4 STAR stories for behavioural prompts
HR tips
Know why Capgemini, not just why the industry
Be clear on location / notice period / higher studies
These links are research inputs we used to map round structure and recurring questions - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways for Capgemini.
After technical rounds, Capgemini usually closes with a short HR / hiring-manager conversation: motivation, location, notice period, and a couple of behavioural stories. Prepare those answers on the dedicated page rather than cramming them into this hub.
