Tip 1 : Strong knowledge of DSA
Tip 2 : Strong knowledge of OOPs
Tip 3 : Good Communication skill
Tip 1 : Add good project that you know properly
Tip 2 : Limit your resume to two pages
The first round they shortlisted candidates from all the students, and luckily I am one of them
Explain types of Polymorphism with their examples (Runtime polymorphism-Method Overriding, Compile-time polymorphism – Method Overloading).
Tip 1 : Be confident
Tip 2 : Be active
What are the pillars of object-oriented programing? (Inheritance, Encapsulation, Abstraction, Polymorphism).
Tip 1 : Be confident
Tip 2 : Be active
About indexing in dbms and query of sql like second highest salary questions
Tip 1 : Be confident
Tip 2 : Be active
Second round they took an assessment on hacker earth and then they took technical interview



a) Duplicate elements may be present.
b) If no such element is present return -1.
Input: Given a sequence of five numbers 2, 4, 5, 6, 8.
Output: 6
Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.
Tip 1 : Solution should be optimized
Tip 2 : You are able to explain solution
Tip 3 : Code should be clear and understandable




Example :
For the given binary tree :
Output : 24 14 2
Explanation: Rightmost diagonal contains elements {5, 10 , 9} its sum is 24, middle diagonal contains elements {6, 3, 5} its sum is 14, leftmost diagonal contains elements {2}. Thus the answer should be “24 14 2”.
Tip 1 : Solution should be optimized
Tip 2 : You are able to explain solution
Tip 3 : Code should be clear and understandable
The third round is face to face technical interview



1
23
345
4567
Tip 1 : The solution should be optimized
Tip 2 : You can explain solution
Tip 3 : Code should be clear and understandable



1. The length of each array is greater than zero.
2. Both the arrays are sorted in non-decreasing order.
3. The output should be in the order of elements that occur in the original arrays.
4. If there is no intersection present then return an empty array.
Tip 1 : Solution should be optimized
Tip 2 : You are able to explain solution
Tip 3 : Code should be clear and understandable
This is the HR round where HR ask some questions related to your hobbies and all that
Introduce yourself
What are your hobbies?
What are your strengths and weaknesses?
Are you in for a bond for 2 years?

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