Skip to contentSkip to footer

Algorithm Engineer Interview Questions

Salaries
Interviews

880 algorithm engineer interview questions shared by candidates

1. if you have a video camera on top of a vehilce, and you shoot a car that come right in front of your car, how can you tell the time t that will take the car to crash you? 2.asked me to solve the binary distance transform problem with 1d, and later on as home work - to solve the 2d problem.
avatar

Algorithm Developer

Interviewed at General Motors (GM)

3.5★
Oct 30, 2020

1. if you have a video camera on top of a vehilce, and you shoot a car that come right in front of your car, how can you tell the time t that will take the car to crash you? 2.asked me to solve the binary distance transform problem with 1d, and later on as home work - to solve the 2d problem.

1) A pretty number is a number in base 4 whose digits are all either 1 or 0. How many pretty numbers are there < n? 2) Given a list of moves in reversi, return the total number of pieces for each player at the end of the game 3) Trees are given as lists of nodes, where each node is a list with data [key, value, *children), where the order of the children matters. Two trees must be merged (left and right). For a given merged node with the same key between left and right inputs, the merged value should come from the right tree. The list of the merged node's children should start with children from the left tree's child list, and then the leftover right tree's child list. Output (key1,value1,...) in pre-order traversal
avatar

Algorithm Developer Intern

Interviewed at Hudson River Trading

4.1★
Apr 28, 2025

1) A pretty number is a number in base 4 whose digits are all either 1 or 0. How many pretty numbers are there < n? 2) Given a list of moves in reversi, return the total number of pieces for each player at the end of the game 3) Trees are given as lists of nodes, where each node is a list with data [key, value, *children), where the order of the children matters. Two trees must be merged (left and right). For a given merged node with the same key between left and right inputs, the merged value should come from the right tree. The list of the merged node's children should start with children from the left tree's child list, and then the leftover right tree's child list. Output (key1,value1,...) in pre-order traversal

Viewing 701 - 710 interview questions

Glassdoor has 880 interview questions and reports from Algorithm engineer interviews. Prepare for your interview. Get hired. Love your job.