CapgeminiLeetCode Questions
VerifiedCompany-wise coding interview questions asked by Capgemini, ranked by real frequency across 30-day, 3-month, and 6-month recency windows.
# | Problem | Difficulty | Frequency↓ | Acceptance | |
|---|---|---|---|---|---|
| #1 | Two Sum3 sources | Easy | 100% | 57.8% | |
| #3498 | Reverse Degree of a String3 sources | Easy | 89% | 88.9% | |
| #2356 | Easy | 88% | 89.2% | ||
| #283 | Move Zeroes3 sources | Easy | 75% | 64.1% | |
| #3005 | Easy | 75% | 79.8% | ||
| #26 | Remove Duplicates from Sorted Array3 sources | Easy | 68% | 63.2% | |
| #121 | Best Time to Buy and Sell Stock3 sources | Easy | 68% | 57.1% | |
| #189 | Rotate Array3 sources | Medium | 68% | 45.2% | |
| #242 | Valid Anagram3 sources | Easy | 68% | 68.3% | |
| #3 | Medium | 68% | 39.4% | ||
| #217 | Contains Duplicate3 sources | Easy | 68% | 64.5% | |
| #9 | Palindrome Number3 sources | Easy | 63% | 60.7% | |
| #14 | Longest Common Prefix3 sources | Easy | 63% | 47.9% | |
| #4 | Median of Two Sorted Arrays3 sources | Hard | 63% | 47.0% | |
| #626 | Medium | 63% | 74.4% | ||
| #34 | Medium | 63% | 49.3% | ||
| #21 | Merge Two Sorted Lists3 sources | Easy | 63% | 68.5% | |
| #28 | Easy | 63% | 46.9% | ||
| #49 | Group Anagrams3 sources | Medium | 63% | 72.9% | |
| #18 | 4Sum3 sources | Medium | 61% | 41.1% | |
| #2 | Add Two Numbers3 sources | Medium | 52% | 48.8% | |
| #1405 | Longest Happy String3 sources | Medium | 52% | 65.5% | |
| #42 | Trapping Rain Water3 sources | Hard | 52% | 67.7% | |
| #560 | Subarray Sum Equals K3 sources | Medium | 52% | 47.7% | |
| #322 | Coin Change3 sources | Medium | 52% | 48.7% | |
| #75 | Sort Colors3 sources | Medium | 52% | 70.0% | |
| #7 | Reverse Integer3 sources | Medium | 52% | 32.1% | |
| #11 | Container With Most Water3 sources | Medium | 52% | 60.4% | |
| #13 | Roman to Integer3 sources | Easy | 52% | 66.8% | |
| #176 | Medium | 52% | 47.5% | ||
| #2677 | Chunk Array3 sources | Easy | 52% | 84.5% | |
| #66 | Plus One3 sources | Easy | 52% | 50.2% | |
| #1877 | Minimize Maximum Pair Sum in Array3 sources | Medium | 52% | 83.3% | |
| #235 | Medium | 52% | 70.9% | ||
| #349 | Intersection of Two Arrays3 sources | Easy | 52% | 78.0% | |
| #67 | Add Binary3 sources | Easy | 52% | 58.3% | |
| #658 | Find K Closest Elements2 sources | Medium | 52% | 0.5% |
Capgemini Technical Interview Overview & Company-Wise Questions
Software engineering and technical interviews at Capgemini emphasize real-world problem solving, algorithmic efficiency, and scalable data structure design. The curated dataset above contains 37 verified LeetCode problems, categorized by frequency and filtered across recent interview seasons.
Frequently Asked Questions
What are the top LeetCode questions for Capgemini?
Leading questions include Two Sum, Reverse Degree of a String, Number of Unique Subjects Taught by Each Teacher. Reviewing questions with higher recency (within the last 30 to 90 days) yields the highest return on preparation time.
Where can I practice company-wise LeetCode questions for Capgemini?
You can practice all 37 Capgemini LeetCode questions right here on LeetMap Pro. Filter by 30-day, 3-month, and 6-month recency, track your progress with local checkpoints, and practice curated SQL problems completely free.
How should I prepare for Capgemini coding rounds?
Begin by reviewing Medium-difficulty problems (17 tracked), which constitute the majority of technical rounds. Complement coding practice with foundational DSA patterns like Sliding Window, Two Pointers, and Graph Traversal.