Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Technical round with 2 DSA Questions.



Given binary tree :

After the reversal of alternate nodes, the tree will be :

The idea is to segregate the nodes which we need to reverse.
We need to take care of the edge cases i.e it has less than three nodes in which we do not need to do anything and we can simply return the head.


The width of each bar is the same and is equal to 1.
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:

You don't need to print anything. It has already been taken care of. Just implement the given function.
Iterate over every elevation or element and find the maximum elevation on to the left and right of it. Say, the maximum elevation on to the left of the current elevation or element that we are looking at is ‘maxLeftHeight’ and the maximum elevation on to the right of it is ‘maxRightHeight’.
Take the minimum of ‘maxLeftHeight’ and ‘maxRightHeight’ and subtract it from the current elevation or element. This will be the units of water that can be stored at this elevation.
Compute units of water that every elevation can store and sum them up to return the total units of water that can be stored.
Technical round with questions on OS/DBMS.
Explain demand paging?
What is virtual memory?
What is meant by ACID properties in DBMS?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?