General Motors Interview Guide

Showing 3 questions

Ranking

A question's ranking corresponds to how commonly it's asked by General Motors. The higher the ranking, the more likely you'll encounter it in a General Motors interview.

Question

Frequency

Difficulty

Number of Connected Components in an Undirected Graph

Determine the number of disconnected groups (connected components) within a given undirected graph. You're provided the graph's edges and need to find how many separate, reachable islands of nodes exist.

Graphs

Very likely

If you have a General Motors interview, it's very likely that you will get this question

Medium

#1. Number of Connected Components in an Undirected Graph

Medium

Graphs

This question is very likely to be asked in your General Motors interview

Implement Trie (Prefix Tree)

Design a data structure that efficiently stores a set of strings and allows for prefix-based searches. Implement methods to insert strings, search for complete words, and check if any word starts with a given prefix.

TreesStrings

Somewhat likely

If you have a General Motors interview, you might get this question

Medium

#2. Implement Trie (Prefix Tree)

Medium

TreesStrings

This question is somewhat likely to be asked in your General Motors interview

Minimum Path Sum

Find the minimum sum of a path from the top-left to the bottom-right corner of a grid. You can only move down or right at each step.

ArraysDynamic Programming

Somewhat likely