OA (Non-Auto)
Final
1 round
technical + behavioral
Decision
OA (Non-Auto)
Final
1 round
technical + behavioral
Decision
Applications Open
August
Interview Period
September - November
Offers Released
October - December
Implement a queue using only stacks in any programming language you prefer.
Solve a medium-level data structure and algorithm problem involving linked lists.
I was asked to create classes for puzzle pieces and solve the puzzle using graph methods such as BFS and DFS.
Describe how to determine the height of a skyscraper and how to find a fragment of length K.
Sum two numbers represented as linked lists and return the result as a linked list.
How do you check if all three sides of a triangle are equal?
I was asked a medium-level coding question based on recursion and backtracking.
Reverse a given string.
How do you check if a string containing different types of parentheses is valid?
Determine if a string containing extra characters has valid parentheses.