Tip 1 : Study core CS subjects like OS, CN, DBMS etc properly
Tip 2 : Be ready for the basic DSA question
Tip 3 : Try to write code on paper and then code on IDE. They usually ask to write code on white paper
Tip 1 : Mention your projects properly
Tip 2 : Do mention core CS subjects as well. Don't neglect them
MCQ mixture of core CS subjects and one coding question



I took three variables to store max, 2nd max and 3rd max elements while I kept on traversing the array. The time compx. will be O(n) and space compx will be O(1).
This round was mixture of DSA based questions followed by Computer networks questions. I was asked to write the code on paper and then walkthrough the code.



1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.
I used Hashset to solve this problem. Java was my primary language to code and I prefered to solve in it. Keep on adding elements from array in Hashset and the element that returns false means it's already present in hashset and is hence duplicate. Print such element.
Basic HR questions like why Mindtree, do you have any other offers currently etc.

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