OA (Auto)
Resume Screen
Phone Screen
1 round
logistics
Technical
2 rounds
Final
1 round
technical + behavioral
Hiring Manager
1 round
team match
Decision
OA (Auto)
Resume Screen
Phone Screen
1 round
logistics
Technical
2 rounds
Final
1 round
technical + behavioral
Hiring Manager
1 round
team match
Decision
Applications Open
September
Interview Period
September - December
Offers Released
October - December
Explain how to solve the Trapping Rain Water problem and how to merge k sorted lists.
Given a list of integers, use a max heap to repeatedly remove values.
Given an array of integers, return the indices of two numbers whose sum equals the target.
Solve a hard dynamic programming problem similar to those found on LeetCode.
One question involved the Huffman encoding algorithm, which I could not recall correctly; although I provided an alternative solution, the interviewer expected me to use Huffman encoding and eventually gave me a hint, but I was not familiar with how it works.
Find the duplicate number in an array.
Solve data structure and algorithm problems involving geometry, monotonic stacks, and binary search.
Write a C++ container class that supports arbitrarily nested lists and provides an iterator.
I was asked two hard-level LeetCode problems.
Solve three hard dynamic programming problems using C++ or Java.