Lucid Motors Interview Guide

Showing 3 of 9 questions

Ranking

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

Question

Frequency

Difficulty

Collect Coins in a Tree

Imagine a tree where some nodes have coins. You want to collect all the coins, but you can only traverse the tree. Find the minimum number of edges you need to travel to collect all the coins.

ArraysTreesGraphs

Very likely

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

Hard

#1. Collect Coins in a Tree

Hard

Imagine a tree where some nodes have coins. You want to collect all the coins, but you can only traverse the tree. Find the minimum number of edges you need to travel to collect all the coins.

ArraysTreesGraphs

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

Maximum Number of Balls in a Box

You have a range of numbered balls to distribute into boxes. A ball goes into a box based on the sum of its digits, so find the box that ends up with the most balls.

Arrays

Somewhat likely

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

Easy

#2. Maximum Number of Balls in a Box

Easy

You have a range of numbered balls to distribute into boxes. A ball goes into a box based on the sum of its digits, so find the box that ends up with the most balls.

Arrays

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

Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

Somewhat likely

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

Easy

#3. Valid Parentheses

Easy

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

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