OA (Auto)
Resume Screen
Final
2 rounds
technical + behavioral
Decision
OA (Auto)
Resume Screen
Final
2 rounds
technical + behavioral
Decision
Applications Open
September
Interview Period
September - December
Offers Released
November - February
Solve a medium-level LeetCode problem that requires using Dijkstra's algorithm.
Given an array of integers, return the indices of the two numbers that add up to a specific target.
How do you construct a heap tree?
Solve a coding problem involving dynamic programming and graphs.
How do you apply binary search to a 2D matrix?
In the first round, I was asked a graph-based question that required knowledge of a modified breadth-first search (BFS) algorithm.
I was asked to find the first element equal to 1 in a 2D array.
I was asked basic LeetCode easy questions.
What kind of data structure would you use to solve a given problem?
Explain how to solve the "Rotting Oranges" medium-level problem from LeetCode.