OA (Auto)
Resume Screen
Final
2 rounds
technical
Final
1 round
behavioral hr phone
Decision
OA (Auto)
Resume Screen
Final
2 rounds
technical
Final
1 round
behavioral hr phone
Decision
Applications Open
August
Interview Period
August - November
Offers Released
September - December
The second question usually involves matrix operations.
Given a tree with all edges provided and a list of target nodes starting from the root, what is the minimum distance required to visit all target nodes and return to the root? Follow-up: If there are two friends, each with independent target nodes, what is the minimum combined distance traveled by both friends to visit their respective targets, given that at any time, the maximum distance between them is the length of one edge (meaning if one person is at node x, the other can be at the same node, its parent, or one of its children)? Additional follow-up: The same scenario applies, but the maximum allowed distance between the two friends at any time is k, where k is a given integer. What is the minimum combined distance traveled by both?
Given an array of string commands as input, output the correct file path.
Implement an LRU cache and solve a sliding window-related algorithm problem.
Solve LeetCode-style questions that focus on string manipulation.
Implement a TicTacToe game that supports various board shapes.
Implement a pretty print function that centers words without wrapping them around the page.
Design a class and solve one LeetCode problem.
Find the maximal square area that can be formed within a histogram.
Given a string of numbers, add together all duplicate numbers.