Placement & training teams: 2026–27 campus calendars are being locked now. Request a proposal →

Recruiter guide · IT Services (Mass + Premium)

How Capgemini hires freshers.

3 rounds, 4.0-4.25 LPA, and exactly what each round tests. Built from public hiring data and reported interview questions.

Mass + Premium tierHiring in 2025-26Mumbai · Pune · Bengaluru · Hyderabad
See the 3 rounds
DifficultyMedium
Package, approx4.0-4.25 LPA
on a 0-60 LPA scale
Rounds3
resume to offer
Timeline1-4 weeks
Evidence40+interview questions reported

Company snapshot

Who Capgemini hires, and how.

How Capgemini hiresHiring channels
  • On campus

    On-campus and off-campus (Capgemini careers / Superset / SuperSet drives)

  • Hiring route

    Exelerate program for higher track

Fresher hiring in 2025-26What the latest cycle looked like
  1. Mar 2026

    Capgemini Exelerate 2026 fresher hiring guide (Mar 2026) and Capgemini placement papers 2026 indicate active 2026 batch drives

Tech stack
Java.NETPythonSAPcloud
Offices in India
MumbaiPuneBengaluruHyderabad
Listed (EPA: CAP)

Routes in

3 ways in. One bar to clear.

Each route, the role and package it leads to, and its steps.

On-campus

Campus hiring – Analyst / Senior Analyst

7.5 LPAA5

Campus Aug-Jan

  1. 1Technical MCQs
  2. 2English communication MCQs
  3. 3Game-based cognitive test
  4. 4Behavioural
Official page ↗
Off-campus drive

Capgemini Exceller

7.5 LPAA5

Off-campus windows (Q1/Q3)

  1. 1Technical MCQs
  2. 2English communication MCQs
  3. 3Game-based cognitive test
  4. 4Behavioural
Official page ↗
Hackathon / Coding contest

Capgemini Tech Challenge

4.25-7.5 + prizesA4-A5

Annual (Jun-Dec)

  1. 1Online round
  2. 2Hackathon
  3. 3Finale
Official page ↗
CTC breakup, approxApprox: Analyst 4LSenior Analyst ~4.75L

The hiring process

3 rounds, one hiring committee.

Every round in order: what happens, what was asked, and how to clear it.

1
Technical MCQOnline proctored (capgemini/amcat platform) · ~90-120 min
Eliminates
  • Pseudocode ~20-30 Qs (output tracing, recursion, bit ops, loops) + technical MCQs (DBMS ~10, OOP ~10, networking ~5, cloud basics) + English Communication ~30 Qs (RC, grammar, vocabulary, listening; some drives ask a ~150-word email)
  • Sectional cutoffs
  • No negative marking reported
Pseudocode tracingC basicsDBMSOOPNetworking

Tip Practice pseudocode tracing on paper; know C operator precedence and recursion.

Asked in this round
  1. Output of recursive function f(n)=f(n-1)+f(n-2) style pseudocode for n=5
  2. Output of pseudocode using bitwise AND/OR/XOR on integers
  3. Which normal form removes transitive dependency?
2
Game-Based AptitudeOnline · Game-based ~20-45 min; behavioral ~20 min; coding 45 min · + Coding for Engineer track
Eliminates
  • Game-based (4 games, e.g. Deductive Logical Thinking, Inductive grid, Motion Challenge, Switch Challenge, Digit/Grid memory - adaptive)
  • Behavioral: ~100 statements, no elimination per se but profile fit
  • Engineer/Exelerate: 2 coding problems in 45 min
Logical/inductive reasoningWorking memorySpatial reasoningPersonality fitCoding

Tip Practice game simulations (PrepInsta/Capgemini games); answer behavioral consistently and honestly.

Asked in this round
  1. Switch Challenge: identify the symbol permutation code
  2. Motion Challenge: move the ball to the hole in minimum moves
  3. Grid Challenge: recall positions of dots in sequence
3
TechnicalVirtual · 20-45 min (20 min Analyst; 45 min Engineer)
Eliminates

Self-intro, project, language/OOP/DBMS basics, scenario/STAR behavioral, relocation, shifts

OOPDBMSSQLProjectBehavior

Tip Prepare STAR stories; keep answers concise.

Asked in this round
  1. Explain the four pillars of OOP
  2. Write SQL to find duplicate records in a table
  3. Difference between DELETE, TRUNCATE and DROP

What gets tested

Where Capgemini spends its interview time.

Coding topics by shareShare of reported Capgemini DSA questions
  • Arrays & Hashing24%
  • Strings17%
  • Tries / Bit / Math17%
  • Dynamic Programming10%
  • Two Pointers & Sliding Window6%
  • Greedy & Intervals5%
  • Stack & Queue4%
  • Trees & BST4%
Focus areasHow often each area comes up
Asked a lot
DBMSComputer NetworksOOP / Design PatternsAptitude TestCommunication TestLanguage / SystemsProjects / ResumeBehavioral / HM
Sometimes
DSA depthSQLPuzzles / Probability
Rarely
OSLLD / Machine CodingHLD / System Design
What got students the offer
  • Higher scores unlock Senior Analyst/Engineer
Why students were rejected
  • Failing pseudocode cutoff
  • Low game-based score
  • Inconsistent behavioral answers
  • Weak spoken English

How to prepare

What to study, area by area.

Coding and DSA
  • Engineer: LeetCode easy-medium strings/arrays/sliding window
Practise
  1. Longest Palindromic Substring (LC 5)
  2. Count distinct elements in array
  3. Fibonacci-style recursion output
  4. Bitwise AND/OR/XOR pseudocode output
CS fundamentals
  • C/OOP basics, DBMS normalization, networking basics, cloud basics
Practise
  1. Four pillars of OOP
  2. Which normal form removes transitive dependency?
  3. Process vs thread
  4. Stack vs queue
Behavioural and language
  • Pseudocode MCQs (biggest eliminator), game-based aptitude, behavioral competency, English (written email + RC)
Resources candidates usedPrepInsta Capgemini dashboard (pseudocode, game-based), JobRise Capgemini Exelerate guide, PapersAdda Capgemini papers 2026, FACE Prep Capgemini

Interview questions

Questions Capgemini actually asked.

From candidate reports, 2024-26. Filter by type.

  1. 01

    SQL question on joins

    SQLRound 1 – Online...Source ↗
  2. 02

    Which normal form removes transitive dependency?

    DSA / CodingTechnical MCQ
  3. 03

    Write a 150-word email to your manager requesting leave

    DSA / CodingTechnical MCQ
  4. 04

    Stack vs queue

    DSA / CodingTechnical MCQ
  5. 05

    Four pillars of OOP

    CS FundamentalsTechnical MCQ
  6. 06

    Process vs thread

    CS FundamentalsTechnical MCQ
  7. 07

    DBMS keys

    CS FundamentalsTechnical MCQ
  8. 08

    Output of recursive function f(n)=f(n-1)+f(n-2) style pseudocode for n=5

    Aptitude / MCQTechnical MCQ
  9. 09

    Output of pseudocode using bitwise AND/OR/XOR on integers

    Aptitude / MCQTechnical MCQ
  10. 10

    Explain your project

    Project / ResumeTechnical MCQ
  11. 11

    Switch Challenge: identify the symbol permutation code

    DSA / CodingGame-Based Aptitude
  12. 12

    Coding: find longest palindromic substring / count distinct elements in every window

    DSA / CodingGame-Based Aptitude
  13. 13

    Count distinct elements in array

    DSA / CodingGame-Based Aptitude
  14. 14

    Reverse a string / palindrome

    DSA / CodingGame-Based Aptitude
  15. 15

    Grid Challenge: recall positions of dots in sequence

    CS FundamentalsGame-Based Aptitude
  16. 16

    Bitwise AND/OR/XOR pseudocode output

    Aptitude / MCQGame-Based Aptitude
  17. 17

    Motion Challenge: move the ball to the hole in minimum moves

    HR / BehavioralGame-Based Aptitude
  18. 18

    Fibonacci-style recursion output

    HR / BehavioralGame-Based Aptitude
  19. 19

    Second largest element

    HR / BehavioralGame-Based Aptitude
  20. 20

    Python program to print palindrome numbers

    DSA / CodingRound 2 – CodingSource ↗
  21. 21

    AI and its impact on today's world

    DSA / CodingRound 2 – TechnicalSource ↗
  22. 22

    Pseudocode and IT fundamentals (databases, networks, cloud)

    Aptitude / MCQRound 2 – TechnicalSource ↗
  23. 23

    Write a prime number program

    DSA / CodingRound 3 – TechnicalSource ↗
  24. 24

    Compare your college project with your internship project

    Project / ResumeRound 3 – TechnicalSource ↗
  25. 25

    Difference between = and ==

    HR / BehavioralRound 3 – TechnicalSource ↗
  26. 26

    Introduce yourself

    HR / BehavioralRound 3 – TechnicalSource ↗
  27. 27

    Willing to relocate?

    HR / BehavioralRound 3 – TechnicalSource ↗
  28. 28

    Write SQL to find duplicate records in a table

    SQLTechnical
  29. 29

    Find duplicate records with GROUP BY HAVING COUNT(*)>1

    SQLTechnical
  30. 30

    Basic joins

    SQLTechnical
  31. 31

    Explain the four pillars of OOP

    CS FundamentalsTechnical
  32. 32

    Difference between DELETE, TRUNCATE and DROP

    HR / BehavioralTechnical
  33. 33

    Tell me about a time you handled a tight deadline (STAR)

    HR / BehavioralTechnical
  34. 34

    Are you comfortable relocating and working in any technology?

    HR / BehavioralTechnical
  35. 35

    break vs continue vs pass

    DSA / CodingRound 4 – Technical...Source ↗
  36. 36

    Agile methodology

    DSA / CodingRound 4 – Technical...Source ↗
  37. 37

    Waterfall, Spiral and SDLC models and stages

    DSA / CodingRound 4 – Technical...Source ↗
  38. 38

    Difference between primary key and foreign key

    DSA / CodingRound 4 – Technical...Source ↗
  39. 39

    Difference between UNION and UNION ALL

    DSA / CodingRound 4 – Technical...Source ↗
  40. 40

    OOP concepts with examples

    CS FundamentalsRound 4 – Technical...Source ↗
  41. 41

    C++ pointers and friend functions

    CS FundamentalsRound 4 – Technical...Source ↗
  42. 42

    Google Analytics basics (resume)

    Project / ResumeRound 4 – Technical...Source ↗
  43. 43

    What are your ultimate life goals?

    HR / BehavioralRound not specifiedSource ↗
  44. 44

    Why Capgemini?

    HR / BehavioralRound not specifiedSource ↗
  45. 45

    Why should we hire you?

    HR / BehavioralRound not specifiedSource ↗
  46. 46

    How did you overcome a difficult period in life?

    Technical / OtherRound not specifiedSource ↗

Want these as a timed test for your batch?

12-week preparation plan

Twelve weeks to Capgemini-ready.

15-18 h a week. Topics are ordered by how often Capgemini asks them; the bar shows each topic's share of Capgemini questions.

W1 W2 W3W4 W5 W6W7 W8 W9W10W11W12
1
Weeks 1-3Foundations
  • W1
    Arrays & Hashing24%
  • W2
    Two Pointers & Sliding Window6%Strings17%
  • W3
    Binary Search3%Linked List3%
2
Weeks 4-6Core data structures
  • W4
    Stack & Queue4%Heaps1%
  • W5
    Trees & BST4%
  • W6
    Graphs3%
3
Weeks 7-9DP, Greedy & Backtracking
  • W7
    Dynamic Programming10%
  • W8
    Dynamic Programming10%Greedy & Intervals5%
  • W9
    Backtracking2%Tries / Bit / Math17%
4
Week 10Company weak-spots
  • W10
    Top-weighted patterns24%
5
Week 11Capgemini sprint
  • W11
    All DSA questions
6
Week 12Interview mode
  • W12
    Mock interviews
Want the week-by-week plan with problem lists? We send it to placement teams with the Capgemini test.

How Board Infinity helps

Prepare your batch for Capgemini, round by round.

Step 01Capgemini-pattern test

Proctored, in the format of its rounds.

Step 02Batch gap report

Topic by topic, weighted to Capgemini.

Step 03Preparation track

Mapped to these rounds.

Step 04Re-test before the drive

See who is ready, by name.

Free for colleges to start. One Capgemini sample test per student email.
Next step

Prepare your students for Capgemini.

A named member of our academic team replies within one working day.

  1. 1Tell us what you need
  2. 2We run a pre-assessment
  3. 3You get a gap analysis
  4. 4Then your proposal

Or write to connect@boardinfinity.com

Placement Intelligence

Request a proposal

Recruiter tests Request a proposal