OA (Non-Auto)
Final
1 round
technical + behavioral
Decision
OA (Non-Auto)
Final
1 round
technical + behavioral
Decision
Applications Open
September
Interview Period
October - December
Offers Released
November - January
Both questions involved stack problems combined with mathematical concepts.
Merge k sorted arrays, implement next number encoding, build a binary search tree, and check if a string is a palindrome.
Calculate the sum of two large floating-point numbers.
Find the next greater number that can be formed using the same set of digits.
Write a program to solve a maze.
I was asked a standard coding data structures and algorithms question from LeetCode.
I was asked LeetCode-style questions involving arrays, dynamic programming, and stacks.
Describe and explain graph and tree traversal methods.
Implement a basic calculator that supports addition and multiplication operations.
I was asked dynamic programming questions from LeetCode.