1. THERE WERE 4 ROUNDS.

coding +aptitue questions ,2nd round was technical

regardinf=g data structures os,dbms 3rd round was graph ,trees and greedy problems
technical 4th was also hr round where persnality test related questions were asked.
2. Mostly OS and Data Structures (Trees)
3. 3 rounds
1. online test with 2 coding questions.
2. Technical interview
3. Technical and hr interview
only those students were shortlisted from the first round who were able to solve at least 1
coding question
4. technical interview question mostly were on the linked list, trees and some normal
algorithms
5. The coding questions were some which are available in Geeksforgeeks from the DS and
algorithms part.
6. Given a BST and a number, find the closest value to this number in the BST. What is the
height of BST?

7. In technical round focus was completely on data structures - stacks , queues , linked lists
and binary trees. I was also asked questions on sort techniques and complexity analysis
for iterations based on some problem statements given.

8. 1. Reverse linked link with recurssion without recurrsion.

2. Horizontal & vertical level order traversal.
3. Dynamic programming question.
4. Search a word in dictionary.
5. Printing all child nodes in tree.
6. Questions on Stack. &Queue.
7. Old work Project Specifications work.

9. Most of the questions were asked from data structure and algorithms .
They asked hashmap, dp etc.
Prepare well from this topic.Hard code is must so practice coding very well.
The interview are long and cv is not discussed so no need to worry about your cv