General Motors LeetCode interview questions

Explore General Motors questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 14

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Number of Connected Components in an Undirected Graph Depth-First Search Breadth-First Search Union-Find +1 MEDIUM	Medium	100.0%	0.7%
Minimum Possible Maximum Waiting Time Array Dynamic Programming Memoization HARD	Hard	78.8%	0.3%
Number of Steps to Reduce a Number in Binary Representation to One String Bit Manipulation Simulation MEDIUM	Medium	69.7%	0.6%
Implement Trie (Prefix Tree) Hash Table String Design +1 MEDIUM	Medium	65.4%	0.7%
Merge Intervals Array Sorting Quicksort MEDIUM	Medium	65.4%	0.5%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	59.9%	0.5%
Minimum Path Sum Array Dynamic Programming Matrix MEDIUM	Medium	59.9%	0.7%
Dot Product of Two Sparse Vectors Array Hash Table Two Pointers +2 MEDIUM	Medium	59.9%	0.9%
Maximum Sum of 3 Non-Overlapping Subarrays Array Dynamic Programming Sliding Window +1 HARD	Hard	59.9%	0.6%
First Missing Positive Array Hash Table HARD	Hard	52.1%	0.4%
Serialize and Deserialize Binary Tree String Tree Depth-First Search +3 HARD	Hard	52.1%	0.6%
Guess the Word Array Math String +3 HARD	Hard	52.1%	0.4%
Minimum Deletions to Make Character Frequencies Unique Hash Table String Greedy +1 MEDIUM	Medium	52.1%	0.6%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	52.1%	0.7%

Showing 1–14 of 14 matching problems · All Problems

General Motors LeetCode Interview Questions | Grind Practice