A three-round interview process will thoroughly test your knowledge of core data structures. For each topic (stack, heap, linked list, tree, graph), expect questions on:
Implementation: Can you code a stack using a linked list?
Traversal: Perform iterative in-order tree traversal.
Application: Use a heap to find the top K frequent elements.
Problem-Solving: Detect a cycle in a linked list or a graph.
Solicité el puesto a través de un captador. El proceso duró más de 1 semana. Acudí a una entrevista en OYO (Gurgaon, Haryana) en dic 2020
Entrevista
- DS Algo round followed by two tech round comprising of basic to in depth iOS questions
followed by design round
- After the round were over had to wait for a week.
