We had one telephonic round, two F2F technical rounds which were mainly focused on data structures and algorithms, and one design round.

The interviewers were cool and professional. The complete process went very smoothly.

Sort an array containing only 0s, 1s, and 2s. Expected O(n) Complexity.

Implement a Queue using Stacks.

Reverse a singly linked list.

Reverse a singly linked list in groups of size k.

Trapping Rain Water problem.

External Merge Sort.

What is the difference between an interface and abstraction?

Design a data structure that supports insert(), delete(), random_value(), and update() in O(1) time.

Design questions such as Uber system design, project design, or booking system design.