Round 3 (Technical Round )

She asked me , how was your first round , after I answered she asked if I know the tree data structure or not . Then ,

Problem 1 :

You are given the binary tree , you have to find the vertical order traversal of the binary tree . She saw my code , she asked a lot of questions about my code , Like :

• What is auto keyword?

• Why did you use by reference here?

• Why have you used the const keyword here ?

• How is the memory allocated in c++.

Problem 2 :

Before starting the problem she asked some minor questions :

• What is a binary search tree .

• What is a heap .

• What are the types of heap .

• How the insertion works in heap (not code , only dry run )

• What is heapify , how will you do this (not code , only dry run)

You are given a BST which is also a complete binary tree , you have to change the BST to min Heap in O(n) complexity , you don’t have to Create extra nodes , you need to change the value in the BST accordingly. After this problem , she asked a lot of minor questions about my project again :

• What all tech stack you have used ?

• What all dependencies you used in your project?

• How did you achieve login/ signup ?

• What the passport does in your project ?

• Why did you use mongoDB ?

• What was the schema you used in your project?

There were total 5 rounds consisting 1 written round/ coding round ,

3 technical rounds and 1 HR round .