DSA Doctor
Verified Company Vault
General Motors DSA Interview Questions
11 curated coding interview questions directly asked in General Motors technical rounds, sorted by frequency with recency and difficulty diagnostics.
11
Total Questions
1 (9%)
Easy Problems
6 (55%)
Medium Problems
4 (36%)
Hard Problems
🔥 Most Tested Topics:
Arrays (4)Trees (3)Core DSA (2)Design (2)Graphs (1)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | Core DSA | Implementation / Reasoning | 63.7% | 100.0% | 6m |
| 323 | Number of Connected Components in an Undirected Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.0% | 100.0% | all |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 59.8% | 87.5% | 6m |
| 64 | Minimum Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 68.2% | 62.5% | all |
| 1570 | Dot Product of Two Sparse Vectors | Medium | Arrays | Sorting / Prefix / Scan | 89.9% | 62.5% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 50.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 50.0% | all |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | Easy | Core DSA | Implementation / Reasoning | 87.1% | 50.0% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 50.0% | all |
| 843 | Guess the Word | Hard | Strings | Hashing / Sliding Window | 36.7% | 50.0% | all |