General Motors interview questions¶
The most frequent LeetCode problems tagged to General Motors. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 4 distinct problems tagged to General Motors in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 13 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Difficulty mix (last 6 months): Medium 75%, Hard 25%
Most tagged topics (share of problems): String 50%, Array 50%, Sorting 50%, Bit Manipulation 25%, Simulation 25%, Quicksort 25%, Dynamic Programming 25%, Sliding Window 25%, Prefix Sum 25%, Hash Table 25%
Watch out: General Motors has thin LeetCode data. Weight the reported questions and the format notes above more than this list.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | 6 months | String, Bit Manipulation, Simulation |
| 2 | Merge Intervals | Medium | 6 months | Array, Sorting, Quicksort |
| 3 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 6 months | Array, Dynamic Programming, Sliding Window, Prefix Sum |
| 4 | Minimum Deletions to Make Character Frequencies Unique | Medium | 6 months | Hash Table, String, Greedy, Sorting |
Signature problems¶
Problems where General Motors accounts for a large share of all recent tags across companies. These are the most General Motors-specific questions in the data.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | 6 months | String, Bit Manipulation, Simulation |
| 2 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 6 months | Array, Dynamic Programming, Sliding Window, Prefix Sum |
| 3 | Minimum Deletions to Make Character Frequencies Unique | Medium | 6 months | Hash Table, String, Greedy, Sorting |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies