Problem database last updated: June 20, 2025
6 problems · 2 Easy, 3 Medium, 1 Hard · Ranked #223 of 458
2 Easy
33% · avg 23%
3 Medium
50% · avg 59%
1 Hard
17% · avg 18%
Based on 6 reported problems, General Motors interviews are in line with industry averages - 17% Hard vs 18% overall.
Compared to the industry average, General Motors puts unusual emphasis on hash-table (33.3% of problems, 1.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (66.7%), hash-table (33.3%), dynamic-programming (16.7%), matrix (16.7%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
First Missing Positive Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. | Hard | Likely | arrayhash-table | Solve |
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. | Medium | Likely | arraydynamic-programmingmatrix | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
The Number of Full Rounds You Have Played You are participating in an online chess tournament. There is a chess round that starts every 15 minutes. The first round of the day starts at 00:00, and after... | Medium | Likely | mathstring | Solve |
Last Visited Integers Given an integer array nums where nums[i] is either a positive integer or -1. We need to find for each -1 the respective positive integer, which we call the las... | Easy | Likely | arraysimulation | Solve |
Widest Vertical Area Between Two Points Containing No Points Given n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the area. | Easy | Likely | arraysorting | Solve |
First Missing Positive
SolveGiven an unsorted integer array nums. Return the smallest positive integer that is not present in nums.
Minimum Path Sum
SolveGiven a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
The Number of Full Rounds You Have Played
SolveYou are participating in an online chess tournament. There is a chess round that starts every 15 minutes. The first round of the day starts at 00:00, and after...
Last Visited Integers
SolveGiven an integer array nums where nums[i] is either a positive integer or -1. We need to find for each -1 the respective positive integer, which we call the las...
Widest Vertical Area Between Two Points Containing No Points
SolveGiven n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the area.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent General Motors interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
General Motors interviews focus heavily on array, hash-table, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. General Motors interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
General Motors has been reported to ask 6 distinct coding problems. The most common topics are array, hash-table, dynamic-programming. 2 are Easy difficulty, 3 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 6 reported problems, General Motors interviews are in line with industry averages - 17% Hard vs 18% overall. 50% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real General Motors coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a General Motors interview with AIarrow_forward
