General Motors coding interview
questions, leaked.
8 problems reported across recent General Motors interviews. Top patterns: array, hash table, design. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
General Motors screens with eight problems across five difficulty levels, but the distribution is tight: five are medium, two easy, one hard. Arrays dominate at five problems, followed by hash tables at three. You'll see graph traversal, dynamic programming, and design patterns like LRU Cache mixed in. Most candidates don't prep hash-table optimizations or the design problems, which means you can build real confidence on half the list. If you blank mid-assessment on a hash-table or array edge case, StealthCoder runs invisibly during screen share and delivers a working solution in seconds.
Top problems at General Motors
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Number of Connected Components in an Undirected Graph | MEDIUM | 100.0 | 64% | Depth-First Search · Breadth-First Search · Union Find |
| 02 | Minimum Path Sum | MEDIUM | 64.4 | 66% | Array · Dynamic Programming · Matrix |
| 03 | First Missing Positive | HARD | 64.4 | 41% | Array · Hash Table |
| 04 | LRU Cache | MEDIUM | 56.8 | 45% | Hash Table · Linked List · Design |
| 05 | The Number of Full Rounds You Have Played | MEDIUM | 56.8 | 43% | Math · String |
| 06 | Last Visited Integers | EASY | 56.8 | 61% | Array · Simulation |
| 07 | Widest Vertical Area Between Two Points Containing No Points | EASY | 56.8 | 87% | Array · Sorting |
| 08 | Dot Product of Two Sparse Vectors | MEDIUM | 56.8 | 90% | Array · Hash Table · Two Pointers |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual General Motors OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- array5 · 63%
- hash table3 · 38%
- design2 · 25%
- depth first search1 · 13%
- breadth first search1 · 13%
- union find1 · 13%
- graph1 · 13%
- dynamic programming1 · 13%
- matrix1 · 13%
- linked list1 · 13%
Array problems are your anchor point. Five of eight reported problems involve arrays, so drilling two-pointer techniques, prefix sums, and hash-table lookups to optimize array traversal should come first. Hash tables appear in three problems, often paired with arrays or design (like LRU Cache), so you need fluency on both insertion order and collision resolution. The medium-difficulty bulk means you won't face graph-heavy proofs or hard algorithmic leaps, but LRU Cache and the connected-components problem both test depth. One hard problem (First Missing Positive) is a classic array-hash-table combo that trips candidates who skip edge-case handling. If you've drilled array and hash-table fundamentals, you're safe on six of eight. StealthCoder is your hedge for the one hard and the design problem if time pressure kills your recall.
Companies with similar patterns
If you prepped for General Motors, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass General Motors.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
General Motors interview FAQ
Should I spend more time on arrays or hash tables for General Motors?+
Arrays. Five of eight problems involve arrays, so master two-pointer, prefix sums, and sliding-window patterns first. Hash tables show up in three problems, but they're almost always paired with array optimization. Learn hash tables as a tool to speed up array logic, not as a standalone topic.
Is LRU Cache a required problem to study?+
Yes. It's one of eight reported problems and tests three topics at once: hash tables, linked lists, and design. Candidates often skip it because it feels like a system-design question, but here it's a straight coding problem. Spend time on the insertion-order preservation and eviction logic.
How many graph or DFS problems should I expect?+
Only one: 'Number of Connected Components in an Undirected Graph.' It's medium difficulty and covers DFS, BFS, and union-find, so you can solve it three ways. If graph traversal isn't your strength, drill union-find since it's the fastest approach and less error-prone than recursion under time pressure.
What's the hardest problem I need to solve?+
'First Missing Positive' is the only hard problem reported. It's a pure array-hash-table problem that requires both O(n) space and edge-case discipline. Most candidates fail because they don't handle the [1, n] range constraint. Drill this one, then you're safe on the rest.
Are dynamic programming or matrix problems heavy?+
No. 'Minimum Path Sum' is the only DP problem in the eight, and it combines array, DP, and matrix thinking. Don't spend a week on DP patterns. One drill on this problem and the related memoization shape is enough. Focus first on array and hash-table speed.