Round 1:

•   		RESUME Selection.

Round 2:

This was a Technical Interview round. I was first asked to introduce myself. Then the interviewer asked me about my projects in brief. This part of the interview lasted only 2 minutes. Then I was asked a few basic questions related to Oops.

				* What is an Abstract Class?
				* Difference between Sallow copy and deep copy.
				* What is a friend in class?
				* What is a destructor?

and then,

• Which sorting algorithm is best among heap sort and Merge sort. And why?

Then, I was asked to write code for the following questions:

• You are given the heads of two sorted linked lists, list1 and list2. Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.

• You are given an array of integers nums, and there is a sliding window of size k moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.

This interview round lasted for 45 minutes.

Round 3:

This was again a Technical Interview round. I was first asked to introduce myself. Then, I was asked to write code for the following questions:

• Implement Binary Tree from Scratch, given an array of n integers.

				* Create Node.
				* Insert level-wise in the tree.
				* Perform Preorder.

This interview round lasted for 55 minutes.