Tip 1 : Have Patience
Tip 2 : Make your fundamentals strong
Tip 3 : Practice varieties of problems as much as you can.
Tip 4 : Participate in various contests
Tip 1: Have Couple of Projects
Tip 2: Be confident about your project
Tip 3: Highlight the tech stack used in your project.
Tip 4: Keep your Resume classic and simple
Two coding questions of moderate level difficulty were asked in this round.


In the below binary tree :
The duplicate subtrees are {{2, 3}, {3}} and we have to just return the root values of each duplicate subtree, so the output is {2, 3}.



Perform each query on the original array only i.e. every output should be according to the original order of elements.
Let the array be [1, 2, 3, 4, 5, 6] and the queries be {2, 4, 1}. For every query, we’ll perform the required number of left rotations on the array.
For the first query, rotate the given array to the left by 2 elements, so the resultant array is: [3, 4, 5, 6, 1, 2].
For the second query, rotate the given array to the left by 4 elements, so the resultant array is: [5, 6, 1, 2, 3, 4].
For the third query, rotate the given array to the left by 1 element, so the resultant array is: [2, 3, 4, 5, 6, 1].
This was second technical round but it was comparatively easy round to the first one.



Given are ten balls, the task is to place these 10 balls in five lines such that each line contains exactly 4 balls.
Tell me about yourself.
What are your salary expectations?
What is your family background?
Share details of your projects.

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