35 curated coding interview questions directly asked in Capgemini technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 100.0% | 3m |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 87.5% | 6m |
| 1877 | Minimize Maximum Pair Sum in Array | Medium | Arrays | Sorting / Prefix / Scan | 83.3% | 87.5% | 6m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 87.5% | 6m |
| 2356 | Number of Unique Subjects Taught by Each Teacher | Easy | Core DSA | Implementation / Reasoning | 89.2% | 87.5% | all |
| 3498 | Reverse Degree of a String | Easy | Strings | Hashing / Sliding Window | 88.7% | 87.5% | all |
| 3005 | Count Elements With Maximum Frequency | Easy | Arrays | Sorting / Prefix / Scan | 79.8% | 75.0% | all |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 62.5% | all |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |
| 189 | Rotate Array | Medium | Arrays | Sorting / Prefix / Scan | 44.9% | 62.5% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 62.5% | all |
| 626 | Exchange Seats | Medium | Core DSA | Implementation / Reasoning | 74.2% | 62.5% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 62.5% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 62.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | all |
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 62.5% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 50.0% | all |
| 1405 | Longest Happy String | Medium | Strings | Hashing / Sliding Window | 65.5% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 50.0% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 50.0% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 50.0% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 50.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 50.0% | all |
| 176 | Second Highest Salary | Medium | Core DSA | Implementation / Reasoning | 47.0% | 50.0% | all |
| 2677 | Chunk Array | Easy | Arrays | Sorting / Prefix / Scan | 84.6% | 50.0% | all |
| 66 | Plus One | Easy | Core DSA | Implementation / Reasoning | 50.0% | 50.0% | all |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 70.6% | 50.0% | all |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 50.0% | all |