OA (Auto)
Technical
1 round
Final
3-5 rounds
Team Matching
1-5 rounds
Decision
OA (Auto)
Technical
1 round
Final
3-5 rounds
Team Matching
1-5 rounds
Decision
Applications Open
June
Interview Period
July - December
Offers Released
August - December
Solve algorithmic problems similar to those found on LeetCode.
Find the smallest substring with non-repeating characters and solve a variation of the Frog Jump dynamic programming problem.
Find the number of pairs of indices (i, j) such that v[i] = v[j] = v[i+1] + v[i+2] + ... + v[j-1], and provide an O(n log n) time complexity solution.
Explain a dynamic programming approach to solve a stocks problem involving graphs.
Sort the lamps in decreasing order.
Find the best transaction options for exchanging foreign dollars.
Solve a coding question involving a Monotone Stack and improve its time complexity, completing two questions within a 45-minute interview under a tight time constraint.
How do you schedule processes in a linear array?
Explain a technical problem that involves using a heap data structure.
Given n event logs where userEvent[i] represents the userId triggering the ith event, find the maximum length of a subarray in which the frequency of the most frequent user equals the frequency of the least frequent user in the entire array.