OA (Non-Auto)
Resume Screen
Final
2-3 rounds
Decision
Team Matching
OA (Non-Auto)
Resume Screen
Final
2-3 rounds
Decision
Team Matching
Applications Open
June
Interview Period
June - January
Offers Released
October - March
Solve a variation of the "Top K Frequent Elements" problem using heaps and maps.
Given a sequence of n digits, find a subsequence of k digits that forms the largest possible number in order.
Explain the basic time and space complexities for different sorting and searching algorithms.
Solve problems related to arrays and trees.
Solve data structure and algorithm problems involving string manipulation and trees.
Solve a problem similar to LeetCode 300.
Given a string s, find the first non-repeating character and return its index; if no such character exists, return -1.
Solve two LeetCode questions ranging from easy to medium difficulty.
I am asked a backtracking problem in the first interview and a max heap combined with a hashmap problem involving the top k elements in the second interview; both interviewers are very nice, the process feels smooth, and I pass both interviews.
Generate all subsets consisting of only 1’s and 2’s for a given n.