11 curated coding interview questions directly asked in Bcg technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 100.0% | 3m |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium | Trees | DFS / BFS | 68.4% | 100.0% | all |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 100.0% | all |
| 3433 | Count Mentions Per User | Medium | Core DSA | Implementation / Reasoning | 50.8% | 100.0% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 100.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 100.0% | all |
| 3447 | Assign Elements to Groups with Constraints | Medium | Core DSA | Implementation / Reasoning | 27.0% | 100.0% | all |
| 3452 | Sum of Good Numbers | Easy | Arrays | Sorting / Prefix / Scan | 69.7% | 100.0% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 87.5% | all |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 87.5% | all |
| 185 | Department Top Three Salaries | Hard | Core DSA | Implementation / Reasoning | 60.5% | 62.5% | all |