Capgemini Coding Interview Questions
We track 35 coding questions asked at Capgemini, tagged with the algorithms and concepts they test. The most common: Array, Hash Table, Two Pointers, String, Math.
Browse all 35 Capgemini questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array21.3%
- Math10.3%
- Hash Table9.7%
- Two Pointers8.8%
- Database8.8%
- String8.1%
- Sorting5.0%
- Binary Search3.0%
- Dynamic Programming3.0%
- Greedy2.7%
- Other (18)19.5%
How many questions involve each concept
Share of all 35 tracked Capgemini questions that touch each concept. Questions usually involve several, so these overlap.
- Array57.1%
- Hash Table28.6%
- Two Pointers25.7%
- String22.9%
- Math17.1%
- Sorting17.1%
- Binary Search8.6%
- Database8.6%
- Dynamic Programming8.6%
- Greedy8.6%
- Linked List5.7%
- Recursion5.7%
Where Capgemini differs from the average company
Concept weight at Capgemini relative to the average across all companies we track. Green means Capgemini leans on it harder than most.
- Database3.3×
- Two Pointers2.4×
- Recursion2.3×
- Math1.8×
- Dynamic Programming0.48×
Capgemini specialties
Concepts that show up at Capgemini but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 35 tracked Capgemini questions.
- Junior49% (17)
- Mid/Senior46% (16)
- Staff6% (2)
Every concept in Capgemini interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 20 | 57.1% | 21.3% |
| Hash Table | 10 | 28.6% | 9.7% |
| Two Pointers | 9 | 25.7% | 8.8% |
| String | 8 | 22.9% | 8.1% |
| Math | 6 | 17.1% | 10.3% |
| Sorting | 6 | 17.1% | 5.0% |
| Binary Search | 3 | 8.6% | 3.0% |
| Database | 3 | 8.6% | 8.8% |
| Dynamic Programming | 3 | 8.6% | 3.0% |
| Greedy | 3 | 8.6% | 2.7% |
| Linked List | 2 | 5.7% | 2.5% |
| Recursion | 2 | 5.7% | 2.5% |
| Binary Search Tree | 1 | 2.9% | 0.7% |
| Binary Tree | 1 | 2.9% | 0.7% |
| Breadth-First Search | 1 | 2.9% | 1.0% |
| Counting | 1 | 2.9% | 1.0% |
| Depth-First Search | 1 | 2.9% | 0.7% |
| Divide and Conquer | 1 | 2.9% | 1.0% |
| Heap (Priority Queue) | 1 | 2.9% | 1.0% |
| Monotonic Stack | 1 | 2.9% | 0.6% |
| Prefix Sum | 1 | 2.9% | 1.0% |
| Simulation | 1 | 2.9% | 1.5% |
| Sliding Window | 1 | 2.9% | 1.0% |
| Stack | 1 | 2.9% | 0.6% |
| String Matching | 1 | 2.9% | 1.0% |
| Tree | 1 | 2.9% | 0.7% |
| Trie | 1 | 2.9% | 1.0% |
| Union-Find | 1 | 2.9% | 1.0% |
Practice a Capgemini interview
Take a realistic AI-led mock interview with questions Capgemini actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required